./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.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_04-funloop_hard1.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 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 02:22:17,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:22:17,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:22:17,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:22:17,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:22:17,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:22:17,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:22:17,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:22:17,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:22:17,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:22:17,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:22:17,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:22:17,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:22:17,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:22:17,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:22:17,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:22:17,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:22:17,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:22:17,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:22:17,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:22:17,525 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:22:17,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:22:17,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:22:17,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:22:17,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:22:17,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:22:17,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:22:17,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:22:17,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:22:17,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:22:17,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:22:17,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:22:17,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:22:17,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:22:17,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:22:17,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:22:17,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:22:17,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:22:17,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:22:17,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:22:17,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:22:17,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:22:17,545 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:17,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:22:17,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:22:17,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:22:17,571 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:22:17,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:22:17,571 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:22:17,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:22:17,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:22:17,572 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:22:17,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:22:17,573 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:22:17,573 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:22:17,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:22:17,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:22:17,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:22:17,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:22:17,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:22:17,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:22:17,574 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:22:17,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:22:17,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:22:17,575 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:22:17,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:22:17,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:22:17,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:22:17,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:22:17,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:22:17,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:22:17,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:22:17,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:22:17,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:22:17,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:22:17,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:22:17,577 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 -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2022-07-13 02:22:17,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:22:17,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:22:17,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:22:17,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:22:17,791 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:22:17,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2022-07-13 02:22:17,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6380331a/36025eaa394b4b2bb309219956156524/FLAG09cbe0e58 [2022-07-13 02:22:18,233 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:22:18,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2022-07-13 02:22:18,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6380331a/36025eaa394b4b2bb309219956156524/FLAG09cbe0e58 [2022-07-13 02:22:18,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6380331a/36025eaa394b4b2bb309219956156524 [2022-07-13 02:22:18,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:22:18,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:22:18,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:22:18,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:22:18,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:22:18,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:22:18" (1/1) ... [2022-07-13 02:22:18,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d787aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:18, skipping insertion in model container [2022-07-13 02:22:18,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:22:18" (1/1) ... [2022-07-13 02:22:18,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:22:18,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:22:18,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:22:18,636 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:22:18,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:22:18,717 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:22:18,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:18 WrapperNode [2022-07-13 02:22:18,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:22:18,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:22:18,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:22:18,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:22:18,723 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:18" (1/1) ... [2022-07-13 02:22:18,742 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:18" (1/1) ... [2022-07-13 02:22:18,765 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-07-13 02:22:18,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:22:18,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:22:18,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:22:18,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:22:18,772 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:18" (1/1) ... [2022-07-13 02:22:18,772 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:18" (1/1) ... [2022-07-13 02:22:18,787 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:18" (1/1) ... [2022-07-13 02:22:18,788 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:18" (1/1) ... [2022-07-13 02:22:18,792 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:18" (1/1) ... [2022-07-13 02:22:18,800 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:18" (1/1) ... [2022-07-13 02:22:18,801 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:18" (1/1) ... [2022-07-13 02:22:18,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:22:18,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:22:18,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:22:18,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:22:18,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:18" (1/1) ... [2022-07-13 02:22:18,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:22:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:18,856 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:18,861 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:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 02:22:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 02:22:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 02:22:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 02:22:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-13 02:22:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:22:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-13 02:22:18,919 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-13 02:22:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:22:18,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:22:18,924 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:18,993 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:22:18,995 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:22:19,190 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:22:19,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:22:19,196 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 02:22:19,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:22:19 BoogieIcfgContainer [2022-07-13 02:22:19,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:22:19,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:22:19,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:22:19,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:22:19,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:22:18" (1/3) ... [2022-07-13 02:22:19,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7578f4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:22:19, skipping insertion in model container [2022-07-13 02:22:19,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:18" (2/3) ... [2022-07-13 02:22:19,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7578f4e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:22:19, skipping insertion in model container [2022-07-13 02:22:19,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:22:19" (3/3) ... [2022-07-13 02:22:19,202 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2022-07-13 02:22:19,206 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 02:22:19,211 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:22:19,212 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-07-13 02:22:19,212 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 02:22:19,244 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 02:22:19,269 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-13 02:22:19,280 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 110 transitions, 225 flow [2022-07-13 02:22:19,285 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 110 transitions, 225 flow [2022-07-13 02:22:19,287 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 225 flow [2022-07-13 02:22:19,340 INFO L129 PetriNetUnfolder]: 6/109 cut-off events. [2022-07-13 02:22:19,341 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 02:22:19,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 6/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-07-13 02:22:19,348 INFO L116 LiptonReduction]: Number of co-enabled transitions 3072 [2022-07-13 02:22:21,323 INFO L131 LiptonReduction]: Checked pairs total: 4138 [2022-07-13 02:22:21,323 INFO L133 LiptonReduction]: Total number of compositions: 107 [2022-07-13 02:22:21,329 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 32 transitions, 69 flow [2022-07-13 02:22:21,345 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 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,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:22:21,359 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@4dc3635d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9a9bc56 [2022-07-13 02:22:21,359 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-13 02:22:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 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,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-13 02:22:21,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:21,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-13 02:22:21,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:21,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash 13372, now seen corresponding path program 1 times [2022-07-13 02:22:21,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:21,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318488176] [2022-07-13 02:22:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:21,452 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:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:21,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318488176] [2022-07-13 02:22:21,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318488176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:21,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:21,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-13 02:22:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67713249] [2022-07-13 02:22:21,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:21,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 02:22:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:21,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 02:22:21,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:22:21,473 INFO L87 Difference]: Start difference. First operand has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 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:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:21,519 INFO L93 Difference]: Finished difference Result 152 states and 301 transitions. [2022-07-13 02:22:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 02:22:21,521 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:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:21,528 INFO L225 Difference]: With dead ends: 152 [2022-07-13 02:22:21,528 INFO L226 Difference]: Without dead ends: 151 [2022-07-13 02:22:21,528 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:21,530 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:21,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-13 02:22:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-13 02:22:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 116 states have (on average 2.5775862068965516) internal successors, (299), 150 states have internal predecessors, (299), 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,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 299 transitions. [2022-07-13 02:22:21,559 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 299 transitions. Word has length 2 [2022-07-13 02:22:21,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:21,560 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 299 transitions. [2022-07-13 02:22:21,560 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:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 299 transitions. [2022-07-13 02:22:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-13 02:22:21,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:21,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-13 02:22:21,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:22:21,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash 13397, now seen corresponding path program 1 times [2022-07-13 02:22:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:21,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102854916] [2022-07-13 02:22:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:21,593 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:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:21,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102854916] [2022-07-13 02:22:21,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102854916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:21,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:21,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-13 02:22:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117434611] [2022-07-13 02:22:21,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:21,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:21,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:21,596 INFO L87 Difference]: Start difference. First operand 151 states and 299 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:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:21,638 INFO L93 Difference]: Finished difference Result 152 states and 300 transitions. [2022-07-13 02:22:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:21,639 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:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:21,640 INFO L225 Difference]: With dead ends: 152 [2022-07-13 02:22:21,640 INFO L226 Difference]: Without dead ends: 152 [2022-07-13 02:22:21,640 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:21,641 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:21,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-13 02:22:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-13 02:22:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 2.5641025641025643) internal successors, (300), 151 states have internal predecessors, (300), 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,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 300 transitions. [2022-07-13 02:22:21,650 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 300 transitions. Word has length 2 [2022-07-13 02:22:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:21,650 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 300 transitions. [2022-07-13 02:22:21,650 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:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 300 transitions. [2022-07-13 02:22:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 02:22:21,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:21,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 02:22:21,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:22:21,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:21,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash 415715, now seen corresponding path program 1 times [2022-07-13 02:22:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:21,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496422832] [2022-07-13 02:22:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:21,679 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:21,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:21,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496422832] [2022-07-13 02:22:21,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496422832] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:21,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025403647] [2022-07-13 02:22:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:21,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:21,682 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:21,691 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:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:21,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:22:21,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:21,772 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:21,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:22:21,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025403647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:21,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:22:21,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-07-13 02:22:21,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631646219] [2022-07-13 02:22:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:21,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:22:21,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:22:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:21,781 INFO L87 Difference]: Start difference. First operand 152 states and 300 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:21,809 INFO L93 Difference]: Finished difference Result 151 states and 299 transitions. [2022-07-13 02:22:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:22:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:21,811 INFO L225 Difference]: With dead ends: 151 [2022-07-13 02:22:21,811 INFO L226 Difference]: Without dead ends: 151 [2022-07-13 02:22:21,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:21,812 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:21,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-13 02:22:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-13 02:22:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 117 states have (on average 2.5555555555555554) internal successors, (299), 150 states have internal predecessors, (299), 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,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 299 transitions. [2022-07-13 02:22:21,819 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 299 transitions. Word has length 3 [2022-07-13 02:22:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:21,819 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 299 transitions. [2022-07-13 02:22:21,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 299 transitions. [2022-07-13 02:22:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 02:22:21,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:21,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 02:22:21,840 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:22,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:22,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash -499994722, now seen corresponding path program 1 times [2022-07-13 02:22:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973213016] [2022-07-13 02:22:22,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,072 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:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973213016] [2022-07-13 02:22:22,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973213016] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:22,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954867961] [2022-07-13 02:22:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:22,074 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:22,075 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:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:22:22,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:22,127 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:22,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:22,139 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:22,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954867961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:22,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:22,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-13 02:22:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023221035] [2022-07-13 02:22:22,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:22,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 02:22:22,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 02:22:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:22:22,141 INFO L87 Difference]: Start difference. First operand 151 states and 299 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:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,207 INFO L93 Difference]: Finished difference Result 154 states and 302 transitions. [2022-07-13 02:22:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:22:22,207 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:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,208 INFO L225 Difference]: With dead ends: 154 [2022-07-13 02:22:22,209 INFO L226 Difference]: Without dead ends: 154 [2022-07-13 02:22:22,209 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:22,210 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:22,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-13 02:22:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-07-13 02:22:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 2.5166666666666666) internal successors, (302), 153 states have internal predecessors, (302), 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,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 302 transitions. [2022-07-13 02:22:22,216 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 302 transitions. Word has length 6 [2022-07-13 02:22:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,216 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 302 transitions. [2022-07-13 02:22:22,216 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:22,216 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 302 transitions. [2022-07-13 02:22:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:22:22,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,217 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 02:22:22,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 02:22:22,434 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1497170540, now seen corresponding path program 2 times [2022-07-13 02:22:22,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400217638] [2022-07-13 02:22:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,478 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:22,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400217638] [2022-07-13 02:22:22,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400217638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:22,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498435569] [2022-07-13 02:22:22,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:22:22,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:22,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:22,501 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:22,502 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:22,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 02:22:22,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:22:22,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:22:22,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:22,580 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,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:22,624 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,640 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:22,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:22:22,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498435569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:22,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:22:22,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-07-13 02:22:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825782894] [2022-07-13 02:22:22,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:22:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:22:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:22:22,642 INFO L87 Difference]: Start difference. First operand 154 states and 302 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:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,690 INFO L93 Difference]: Finished difference Result 194 states and 387 transitions. [2022-07-13 02:22:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:22,690 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:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,691 INFO L225 Difference]: With dead ends: 194 [2022-07-13 02:22:22,691 INFO L226 Difference]: Without dead ends: 193 [2022-07-13 02:22:22,692 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:22,692 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-13 02:22:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2022-07-13 02:22:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 144 states have (on average 2.486111111111111) internal successors, (358), 177 states have internal predecessors, (358), 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,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 358 transitions. [2022-07-13 02:22:22,698 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 358 transitions. Word has length 9 [2022-07-13 02:22:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,699 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 358 transitions. [2022-07-13 02:22:22,699 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:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 358 transitions. [2022-07-13 02:22:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 02:22:22,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,699 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,718 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:22,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:22,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -832353495, now seen corresponding path program 1 times [2022-07-13 02:22:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801768016] [2022-07-13 02:22:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,959 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:22,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801768016] [2022-07-13 02:22:22,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801768016] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730401554] [2022-07-13 02:22:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:22,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:22,962 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,963 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:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 02:22:23,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:23,027 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:23,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:23,066 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:23,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730401554] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:23,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:23,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-13 02:22:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603713926] [2022-07-13 02:22:23,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:23,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 02:22:23,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:23,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 02:22:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:22:23,068 INFO L87 Difference]: Start difference. First operand 178 states and 358 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:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:23,144 INFO L93 Difference]: Finished difference Result 184 states and 364 transitions. [2022-07-13 02:22:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:22:23,145 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:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:23,145 INFO L225 Difference]: With dead ends: 184 [2022-07-13 02:22:23,146 INFO L226 Difference]: Without dead ends: 184 [2022-07-13 02:22:23,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:22:23,146 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:23,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-13 02:22:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-07-13 02:22:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 2.4266666666666667) internal successors, (364), 183 states have internal predecessors, (364), 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:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 364 transitions. [2022-07-13 02:22:23,151 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 364 transitions. Word has length 10 [2022-07-13 02:22:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:23,152 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 364 transitions. [2022-07-13 02:22:23,152 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:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 364 transitions. [2022-07-13 02:22:23,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:22:23,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:23,153 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:23,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 02:22:23,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:23,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1620250729, now seen corresponding path program 2 times [2022-07-13 02:22:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:23,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853575430] [2022-07-13 02:22:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,468 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:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:23,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853575430] [2022-07-13 02:22:23,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853575430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:23,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:23,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:22:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374913859] [2022-07-13 02:22:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:23,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:22:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:22:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:23,479 INFO L87 Difference]: Start difference. First operand 184 states and 364 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:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:23,549 INFO L93 Difference]: Finished difference Result 192 states and 376 transitions. [2022-07-13 02:22:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:22:23,550 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:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:23,551 INFO L225 Difference]: With dead ends: 192 [2022-07-13 02:22:23,551 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 02:22:23,551 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:23,551 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:23,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 02:22:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 185. [2022-07-13 02:22:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 151 states have (on average 2.4172185430463577) internal successors, (365), 184 states have internal predecessors, (365), 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:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 365 transitions. [2022-07-13 02:22:23,556 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 365 transitions. Word has length 16 [2022-07-13 02:22:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:23,556 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 365 transitions. [2022-07-13 02:22:23,556 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:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 365 transitions. [2022-07-13 02:22:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:22:23,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:23,557 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:23,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 02:22:23,557 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:23,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1620268424, now seen corresponding path program 1 times [2022-07-13 02:22:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:23,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261496092] [2022-07-13 02:22:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,606 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:23,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:23,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261496092] [2022-07-13 02:22:23,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261496092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:23,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:23,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:22:23,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877130337] [2022-07-13 02:22:23,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:23,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:22:23,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:22:23,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:23,608 INFO L87 Difference]: Start difference. First operand 185 states and 365 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:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:23,671 INFO L93 Difference]: Finished difference Result 187 states and 366 transitions. [2022-07-13 02:22:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:22:23,671 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:23,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:23,672 INFO L225 Difference]: With dead ends: 187 [2022-07-13 02:22:23,672 INFO L226 Difference]: Without dead ends: 187 [2022-07-13 02:22:23,672 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:23,673 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:23,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-13 02:22:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2022-07-13 02:22:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 2.4066666666666667) internal successors, (361), 183 states have internal predecessors, (361), 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:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 361 transitions. [2022-07-13 02:22:23,677 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 361 transitions. Word has length 16 [2022-07-13 02:22:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:23,677 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 361 transitions. [2022-07-13 02:22:23,677 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:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 361 transitions. [2022-07-13 02:22:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:22:23,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:23,678 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:23,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 02:22:23,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2012196682, now seen corresponding path program 1 times [2022-07-13 02:22:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:23,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759825818] [2022-07-13 02:22:23,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:23,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,702 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:23,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:23,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759825818] [2022-07-13 02:22:23,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759825818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:23,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:23,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:22:23,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393012632] [2022-07-13 02:22:23,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:23,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:23,704 INFO L87 Difference]: Start difference. First operand 184 states and 361 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:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:23,747 INFO L93 Difference]: Finished difference Result 266 states and 524 transitions. [2022-07-13 02:22:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:23,747 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:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:23,748 INFO L225 Difference]: With dead ends: 266 [2022-07-13 02:22:23,748 INFO L226 Difference]: Without dead ends: 266 [2022-07-13 02:22:23,748 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:23,749 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:23,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:23,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-13 02:22:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 238. [2022-07-13 02:22:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 204 states have (on average 2.4313725490196076) internal successors, (496), 237 states have internal predecessors, (496), 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:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 496 transitions. [2022-07-13 02:22:23,754 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 496 transitions. Word has length 18 [2022-07-13 02:22:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:23,754 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 496 transitions. [2022-07-13 02:22:23,754 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:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 496 transitions. [2022-07-13 02:22:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:22:23,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:23,755 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:23,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 02:22:23,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1995219332, now seen corresponding path program 1 times [2022-07-13 02:22:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:23,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091787595] [2022-07-13 02:22:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,778 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:23,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:23,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091787595] [2022-07-13 02:22:23,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091787595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:23,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:23,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:22:23,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116304955] [2022-07-13 02:22:23,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:23,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:23,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:23,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:23,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:23,780 INFO L87 Difference]: Start difference. First operand 238 states and 496 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:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:23,820 INFO L93 Difference]: Finished difference Result 296 states and 610 transitions. [2022-07-13 02:22:23,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:23,820 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:23,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:23,822 INFO L225 Difference]: With dead ends: 296 [2022-07-13 02:22:23,822 INFO L226 Difference]: Without dead ends: 296 [2022-07-13 02:22:23,822 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:23,822 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:23,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-13 02:22:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 276. [2022-07-13 02:22:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 242 states have (on average 2.43801652892562) internal successors, (590), 275 states have internal predecessors, (590), 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:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 590 transitions. [2022-07-13 02:22:23,843 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 590 transitions. Word has length 18 [2022-07-13 02:22:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:23,843 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 590 transitions. [2022-07-13 02:22:23,843 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:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 590 transitions. [2022-07-13 02:22:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:22:23,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:23,844 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:23,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 02:22:23,845 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2047294509, now seen corresponding path program 1 times [2022-07-13 02:22:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:23,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973395291] [2022-07-13 02:22:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,909 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:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:23,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973395291] [2022-07-13 02:22:23,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973395291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:23,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:23,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:22:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445964756] [2022-07-13 02:22:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:23,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:22:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:23,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:22:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:22:23,911 INFO L87 Difference]: Start difference. First operand 276 states and 590 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:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:23,993 INFO L93 Difference]: Finished difference Result 337 states and 715 transitions. [2022-07-13 02:22:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:22:23,993 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:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:23,995 INFO L225 Difference]: With dead ends: 337 [2022-07-13 02:22:23,995 INFO L226 Difference]: Without dead ends: 337 [2022-07-13 02:22:23,995 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:23,996 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:23,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-13 02:22:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 308. [2022-07-13 02:22:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 274 states have (on average 2.4014598540145986) internal successors, (658), 307 states have internal predecessors, (658), 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:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 658 transitions. [2022-07-13 02:22:24,001 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 658 transitions. Word has length 19 [2022-07-13 02:22:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,002 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 658 transitions. [2022-07-13 02:22:24,002 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:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 658 transitions. [2022-07-13 02:22:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:24,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,003 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 02:22:24,003 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash -956786953, now seen corresponding path program 1 times [2022-07-13 02:22:24,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195343791] [2022-07-13 02:22:24,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,087 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:24,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195343791] [2022-07-13 02:22:24,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195343791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256040851] [2022-07-13 02:22:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:24,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:24,089 INFO L87 Difference]: Start difference. First operand 308 states and 658 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:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,250 INFO L93 Difference]: Finished difference Result 343 states and 715 transitions. [2022-07-13 02:22:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 02:22:24,250 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:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,252 INFO L225 Difference]: With dead ends: 343 [2022-07-13 02:22:24,252 INFO L226 Difference]: Without dead ends: 343 [2022-07-13 02:22:24,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:22:24,253 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-13 02:22:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 318. [2022-07-13 02:22:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 284 states have (on average 2.390845070422535) internal successors, (679), 317 states have internal predecessors, (679), 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:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 679 transitions. [2022-07-13 02:22:24,258 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 679 transitions. Word has length 20 [2022-07-13 02:22:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,259 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 679 transitions. [2022-07-13 02:22:24,259 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:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 679 transitions. [2022-07-13 02:22:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:24,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,260 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 02:22:24,260 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -956753634, now seen corresponding path program 1 times [2022-07-13 02:22:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526046984] [2022-07-13 02:22:24,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,354 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:24,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526046984] [2022-07-13 02:22:24,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526046984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:24,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369656784] [2022-07-13 02:22:24,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:24,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:24,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:24,356 INFO L87 Difference]: Start difference. First operand 318 states and 679 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:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,538 INFO L93 Difference]: Finished difference Result 344 states and 721 transitions. [2022-07-13 02:22:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:22:24,538 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:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,540 INFO L225 Difference]: With dead ends: 344 [2022-07-13 02:22:24,540 INFO L226 Difference]: Without dead ends: 344 [2022-07-13 02:22:24,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:22:24,541 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-13 02:22:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 325. [2022-07-13 02:22:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 291 states have (on average 2.381443298969072) internal successors, (693), 324 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:22:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 693 transitions. [2022-07-13 02:22:24,547 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 693 transitions. Word has length 20 [2022-07-13 02:22:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,547 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 693 transitions. [2022-07-13 02:22:24,547 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:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 693 transitions. [2022-07-13 02:22:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:24,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,548 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 02:22:24,548 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -958368114, now seen corresponding path program 2 times [2022-07-13 02:22:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347293701] [2022-07-13 02:22:24,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,620 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:24,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347293701] [2022-07-13 02:22:24,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347293701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:24,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774681898] [2022-07-13 02:22:24,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:24,622 INFO L87 Difference]: Start difference. First operand 325 states and 693 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:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,798 INFO L93 Difference]: Finished difference Result 349 states and 731 transitions. [2022-07-13 02:22:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 02:22:24,798 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:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,800 INFO L225 Difference]: With dead ends: 349 [2022-07-13 02:22:24,800 INFO L226 Difference]: Without dead ends: 349 [2022-07-13 02:22:24,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:22:24,800 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-13 02:22:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 324. [2022-07-13 02:22:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 290 states have (on average 2.382758620689655) internal successors, (691), 323 states have internal predecessors, (691), 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:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 691 transitions. [2022-07-13 02:22:24,805 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 691 transitions. Word has length 20 [2022-07-13 02:22:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,806 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 691 transitions. [2022-07-13 02:22:24,806 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:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 691 transitions. [2022-07-13 02:22:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:24,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,806 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 02:22:24,806 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash -958379274, now seen corresponding path program 3 times [2022-07-13 02:22:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401326445] [2022-07-13 02:22:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,876 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:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401326445] [2022-07-13 02:22:24,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401326445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:24,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568543421] [2022-07-13 02:22:24,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:24,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:24,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:24,878 INFO L87 Difference]: Start difference. First operand 324 states and 691 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:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:25,069 INFO L93 Difference]: Finished difference Result 340 states and 710 transitions. [2022-07-13 02:22:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:22:25,069 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:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:25,070 INFO L225 Difference]: With dead ends: 340 [2022-07-13 02:22:25,070 INFO L226 Difference]: Without dead ends: 340 [2022-07-13 02:22:25,071 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:25,071 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:25,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-07-13 02:22:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 320. [2022-07-13 02:22:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 286 states have (on average 2.3811188811188813) internal successors, (681), 319 states have internal predecessors, (681), 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:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 681 transitions. [2022-07-13 02:22:25,076 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 681 transitions. Word has length 20 [2022-07-13 02:22:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:25,076 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 681 transitions. [2022-07-13 02:22:25,076 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:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 681 transitions. [2022-07-13 02:22:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:25,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:25,077 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:25,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 02:22:25,077 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash -985684564, now seen corresponding path program 1 times [2022-07-13 02:22:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:25,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498423769] [2022-07-13 02:22:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:25,165 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:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:25,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498423769] [2022-07-13 02:22:25,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498423769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:25,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13054719] [2022-07-13 02:22:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:25,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:25,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:25,180 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:25,220 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:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:25,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:22:25,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:25,278 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:25,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:25,335 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:25,379 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:35,307 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:35,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:42,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203| Int) (|t_funThread1of1ForFork0_~i~0#1| Int) (v_ArrVal_433 (Array Int Int)) (v_ArrVal_435 Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_433) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203| v_ArrVal_435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_40|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) is different from false [2022-07-13 02:22:42,619 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:42,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13054719] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:42,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:42,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:22:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258297615] [2022-07-13 02:22:42,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:42,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:22:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:42,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:22:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=205, Unknown=20, NotChecked=32, Total=342 [2022-07-13 02:22:42,622 INFO L87 Difference]: Start difference. First operand 320 states and 681 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:22:42,627 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203| Int) (|t_funThread1of1ForFork0_~i~0#1| Int) (v_ArrVal_433 (Array Int Int)) (v_ArrVal_435 Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_433) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203| v_ArrVal_435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_40|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203|)) (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:22:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:43,139 INFO L93 Difference]: Finished difference Result 346 states and 721 transitions. [2022-07-13 02:22:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:22:43,139 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:22:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:43,140 INFO L225 Difference]: With dead ends: 346 [2022-07-13 02:22:43,141 INFO L226 Difference]: Without dead ends: 346 [2022-07-13 02:22:43,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=94, Invalid=235, Unknown=21, NotChecked=70, Total=420 [2022-07-13 02:22:43,141 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:43,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 268 Unchecked, 0.1s Time] [2022-07-13 02:22:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-13 02:22:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 328. [2022-07-13 02:22:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 294 states have (on average 2.380952380952381) internal successors, (700), 327 states have internal predecessors, (700), 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:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 700 transitions. [2022-07-13 02:22:43,146 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 700 transitions. Word has length 20 [2022-07-13 02:22:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:43,146 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 700 transitions. [2022-07-13 02:22:43,146 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:22:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 700 transitions. [2022-07-13 02:22:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:43,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:43,147 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:43,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 02:22:43,354 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,SelfDestructingSolverStorable15 [2022-07-13 02:22:43,355 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:43,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1277636023, now seen corresponding path program 2 times [2022-07-13 02:22:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:43,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348663614] [2022-07-13 02:22:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:43,480 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:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:43,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348663614] [2022-07-13 02:22:43,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348663614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:43,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:43,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792309202] [2022-07-13 02:22:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:43,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:43,482 INFO L87 Difference]: Start difference. First operand 328 states and 700 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:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:43,779 INFO L93 Difference]: Finished difference Result 363 states and 757 transitions. [2022-07-13 02:22:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 02:22:43,779 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:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:43,780 INFO L225 Difference]: With dead ends: 363 [2022-07-13 02:22:43,780 INFO L226 Difference]: Without dead ends: 363 [2022-07-13 02:22:43,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:22:43,781 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:43,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:22:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-13 02:22:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 327. [2022-07-13 02:22:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 293 states have (on average 2.3822525597269624) internal successors, (698), 326 states have internal predecessors, (698), 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:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 698 transitions. [2022-07-13 02:22:43,787 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 698 transitions. Word has length 20 [2022-07-13 02:22:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:43,788 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 698 transitions. [2022-07-13 02:22:43,788 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:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 698 transitions. [2022-07-13 02:22:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:43,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:43,789 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:43,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 02:22:43,790 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:43,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1279874533, now seen corresponding path program 3 times [2022-07-13 02:22:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:43,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340504070] [2022-07-13 02:22:43,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:43,892 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:43,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:43,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340504070] [2022-07-13 02:22:43,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340504070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:43,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:43,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759176680] [2022-07-13 02:22:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:43,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:43,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:43,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:43,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:43,895 INFO L87 Difference]: Start difference. First operand 327 states and 698 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:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:44,165 INFO L93 Difference]: Finished difference Result 347 states and 722 transitions. [2022-07-13 02:22:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:22:44,166 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:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:44,169 INFO L225 Difference]: With dead ends: 347 [2022-07-13 02:22:44,169 INFO L226 Difference]: Without dead ends: 347 [2022-07-13 02:22:44,170 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:44,171 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:44,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:22:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-13 02:22:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 320. [2022-07-13 02:22:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 286 states have (on average 2.3846153846153846) internal successors, (682), 319 states have internal predecessors, (682), 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:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 682 transitions. [2022-07-13 02:22:44,177 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 682 transitions. Word has length 20 [2022-07-13 02:22:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:44,178 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 682 transitions. [2022-07-13 02:22:44,178 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:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 682 transitions. [2022-07-13 02:22:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:44,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:44,179 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:44,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 02:22:44,179 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:44,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1850339221, now seen corresponding path program 1 times [2022-07-13 02:22:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:44,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213655642] [2022-07-13 02:22:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:44,287 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:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:44,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213655642] [2022-07-13 02:22:44,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213655642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:44,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282833057] [2022-07-13 02:22:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:44,290 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:22:44,291 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:22:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:44,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:22:44,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:44,373 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:44,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:44,412 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:44,447 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:55,887 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:55,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:02,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_565 (Array Int Int)) (v_ArrVal_567 Int) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_113| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134|) (+ (* |v_ULTIMATE.start_main_~i~2#1_113| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_565) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| v_ArrVal_567) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_113|)))) is different from false [2022-07-13 02:23:02,622 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:02,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282833057] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:02,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:02,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:23:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018504927] [2022-07-13 02:23:02,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:02,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:23:02,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:02,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:23:02,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:23:02,626 INFO L87 Difference]: Start difference. First operand 320 states and 682 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:02,630 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_565 (Array Int Int)) (v_ArrVal_567 Int) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_113| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134|) (+ (* |v_ULTIMATE.start_main_~i~2#1_113| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_565) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| v_ArrVal_567) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_113|)))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-13 02:23:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:03,791 INFO L93 Difference]: Finished difference Result 346 states and 729 transitions. [2022-07-13 02:23:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:23:03,792 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:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:03,793 INFO L225 Difference]: With dead ends: 346 [2022-07-13 02:23:03,793 INFO L226 Difference]: Without dead ends: 346 [2022-07-13 02:23:03,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=103, Invalid=264, Unknown=21, NotChecked=74, Total=462 [2022-07-13 02:23:03,794 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:03,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 373 Unchecked, 0.1s Time] [2022-07-13 02:23:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-13 02:23:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 327. [2022-07-13 02:23:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 293 states have (on average 2.3890784982935154) internal successors, (700), 326 states have internal predecessors, (700), 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:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 700 transitions. [2022-07-13 02:23:03,799 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 700 transitions. Word has length 20 [2022-07-13 02:23:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:03,799 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 700 transitions. [2022-07-13 02:23:03,799 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:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 700 transitions. [2022-07-13 02:23:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:23:03,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:03,799 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:03,818 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:04,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:04,016 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:23:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash -491450081, now seen corresponding path program 1 times [2022-07-13 02:23:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:04,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851342] [2022-07-13 02:23:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:04,110 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:04,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:04,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851342] [2022-07-13 02:23:04,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851342] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:23:04,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062888870] [2022-07-13 02:23:04,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:04,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:23:04,124 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:04,125 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:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:04,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:23:04,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:23:04,213 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:04,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:23:04,255 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:04,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:19,168 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:19,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:25,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207| Int) (v_ArrVal_635 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208| Int) (|v_t_funThread1of1ForFork0_~i~0#1_135| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_637 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_135|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_635) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208| v_ArrVal_637) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_135| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208|)))) is different from false [2022-07-13 02:23:25,785 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:25,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062888870] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:25,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:25,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:23:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391042856] [2022-07-13 02:23:25,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:25,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:23:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:25,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:23:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-13 02:23:25,787 INFO L87 Difference]: Start difference. First operand 327 states and 700 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:23:25,792 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207| Int) (v_ArrVal_635 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208| Int) (|v_t_funThread1of1ForFork0_~i~0#1_135| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_637 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_135|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_635) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208| v_ArrVal_637) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_135| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208|)))) (= |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:23:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:27,055 INFO L93 Difference]: Finished difference Result 350 states and 734 transitions. [2022-07-13 02:23:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 02:23:27,055 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:23:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:27,057 INFO L225 Difference]: With dead ends: 350 [2022-07-13 02:23:27,057 INFO L226 Difference]: Without dead ends: 350 [2022-07-13 02:23:27,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=101, Invalid=268, Unknown=19, NotChecked=74, Total=462 [2022-07-13 02:23:27,058 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:27,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 280 Unchecked, 0.1s Time] [2022-07-13 02:23:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-13 02:23:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 330. [2022-07-13 02:23:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 296 states have (on average 2.391891891891892) internal successors, (708), 329 states have internal predecessors, (708), 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:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 708 transitions. [2022-07-13 02:23:27,074 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 708 transitions. Word has length 21 [2022-07-13 02:23:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:27,075 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 708 transitions. [2022-07-13 02:23:27,075 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:23:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 708 transitions. [2022-07-13 02:23:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:23:27,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:27,076 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:27,092 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:23:27,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:27,279 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:23:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash -491461241, now seen corresponding path program 2 times [2022-07-13 02:23:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646926462] [2022-07-13 02:23:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:27,433 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:27,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:27,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646926462] [2022-07-13 02:23:27,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646926462] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:23:27,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123661287] [2022-07-13 02:23:27,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:23:27,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:23:27,453 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:23:27,456 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:23:27,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:23:27,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:23:27,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:23:27,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:23:27,540 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:27,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:23:27,597 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:27,640 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:40,244 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:40,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:48,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_139| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_705) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212| v_ArrVal_706) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211|) 2147483646) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_139|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_139| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) is different from false [2022-07-13 02:23:49,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:23:49,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123661287] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:49,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:49,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:23:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094052791] [2022-07-13 02:23:49,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:49,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:23:49,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:49,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:23:49,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=206, Unknown=20, NotChecked=32, Total=342 [2022-07-13 02:23:49,088 INFO L87 Difference]: Start difference. First operand 330 states and 708 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:23:49,091 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_t_funThread1of1ForFork0_~i~0#1_139| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_705) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212| v_ArrVal_706) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211|) 2147483646) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_139|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_139| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|))))) is different from false [2022-07-13 02:23:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:49,927 INFO L93 Difference]: Finished difference Result 338 states and 724 transitions. [2022-07-13 02:23:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:23:49,928 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:23:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:49,929 INFO L225 Difference]: With dead ends: 338 [2022-07-13 02:23:49,929 INFO L226 Difference]: Without dead ends: 338 [2022-07-13 02:23:49,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=93, Invalid=236, Unknown=21, NotChecked=70, Total=420 [2022-07-13 02:23:49,930 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:49,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 217 Unchecked, 0.0s Time] [2022-07-13 02:23:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-13 02:23:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 326. [2022-07-13 02:23:49,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 292 states have (on average 2.3904109589041096) internal successors, (698), 325 states have internal predecessors, (698), 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:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 698 transitions. [2022-07-13 02:23:49,939 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 698 transitions. Word has length 21 [2022-07-13 02:23:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:49,940 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 698 transitions. [2022-07-13 02:23:49,941 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:23:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 698 transitions. [2022-07-13 02:23:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:23:49,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:49,941 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:49,960 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:23:50,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-13 02:23:50,159 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:23:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1525941050, now seen corresponding path program 1 times [2022-07-13 02:23:50,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:50,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229827790] [2022-07-13 02:23:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:50,250 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:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:50,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229827790] [2022-07-13 02:23:50,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229827790] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:23:50,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090041270] [2022-07-13 02:23:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:50,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:50,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:23:50,260 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:23:50,261 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:23:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:50,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:23:50,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:23:50,347 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:50,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:23:50,391 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:50,432 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:04,593 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:04,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:24:10,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_121| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_121|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| (* |v_ULTIMATE.start_main_~i~2#1_121| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_775) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| v_ArrVal_777) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|)))) is different from false [2022-07-13 02:24:11,053 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:11,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090041270] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:24:11,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:24:11,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:24:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232389147] [2022-07-13 02:24:11,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:24:11,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:24:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:24:11,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:24:11,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-13 02:24:11,055 INFO L87 Difference]: Start difference. First operand 326 states and 698 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:11,060 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_~#t1~0#1.base_44| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_121| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_121|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| (* |v_ULTIMATE.start_main_~i~2#1_121| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_775) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| v_ArrVal_777) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|))))) is different from false [2022-07-13 02:24:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:24:12,356 INFO L93 Difference]: Finished difference Result 353 states and 746 transitions. [2022-07-13 02:24:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:24:12,356 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:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:24:12,357 INFO L225 Difference]: With dead ends: 353 [2022-07-13 02:24:12,357 INFO L226 Difference]: Without dead ends: 353 [2022-07-13 02:24:12,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=103, Invalid=265, Unknown=20, NotChecked=74, Total=462 [2022-07-13 02:24:12,359 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:24:12,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 221 Unchecked, 0.1s Time] [2022-07-13 02:24:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-13 02:24:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2022-07-13 02:24:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 295 states have (on average 2.389830508474576) internal successors, (705), 328 states have internal predecessors, (705), 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:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 705 transitions. [2022-07-13 02:24:12,383 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 705 transitions. Word has length 21 [2022-07-13 02:24:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:24:12,383 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 705 transitions. [2022-07-13 02:24:12,383 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:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 705 transitions. [2022-07-13 02:24:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:24:12,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:24:12,403 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:24:12,419 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:24:12,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:24:12,619 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:24:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:24:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1525981040, now seen corresponding path program 2 times [2022-07-13 02:24:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:24:12,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633269045] [2022-07-13 02:24:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:24:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:24:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:24:12,712 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:12,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:24:12,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633269045] [2022-07-13 02:24:12,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633269045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:24:12,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169065629] [2022-07-13 02:24:12,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:24:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:24:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:24:12,727 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:24:12,731 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:24:12,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:24:12,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:24:12,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:24:12,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:24:12,819 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:12,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:24:12,864 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:12,905 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:27,818 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:27,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:24:34,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140| Int) (v_ArrVal_846 Int) (|v_ULTIMATE.start_main_~i~2#1_125| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140|) (+ (* |v_ULTIMATE.start_main_~i~2#1_125| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_845) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| v_ArrVal_846) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_125|)))) is different from false [2022-07-13 02:24:34,696 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:34,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169065629] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:24:34,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:24:34,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:24:34,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945871239] [2022-07-13 02:24:34,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:24:34,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:24:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:24:34,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:24:34,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:24:34,698 INFO L87 Difference]: Start difference. First operand 329 states and 705 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:34,702 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_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140| Int) (v_ArrVal_846 Int) (|v_ULTIMATE.start_main_~i~2#1_125| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140|) (+ (* |v_ULTIMATE.start_main_~i~2#1_125| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_845) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| v_ArrVal_846) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_125|))))) is different from false [2022-07-13 02:24:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:24:35,507 INFO L93 Difference]: Finished difference Result 347 states and 732 transitions. [2022-07-13 02:24:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:24:35,507 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:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:24:35,509 INFO L225 Difference]: With dead ends: 347 [2022-07-13 02:24:35,509 INFO L226 Difference]: Without dead ends: 347 [2022-07-13 02:24:35,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=94, Invalid=236, Unknown=20, NotChecked=70, Total=420 [2022-07-13 02:24:35,509 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:24:35,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2022-07-13 02:24:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-13 02:24:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 326. [2022-07-13 02:24:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 292 states have (on average 2.3904109589041096) internal successors, (698), 325 states have internal predecessors, (698), 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:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 698 transitions. [2022-07-13 02:24:35,515 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 698 transitions. Word has length 21 [2022-07-13 02:24:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:24:35,515 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 698 transitions. [2022-07-13 02:24:35,524 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:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 698 transitions. [2022-07-13 02:24:35,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:24:35,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:24:35,525 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:24:35,543 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:24:35,735 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,SelfDestructingSolverStorable22 [2022-07-13 02:24:35,735 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:24:35,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:24:35,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1879380633, now seen corresponding path program 1 times [2022-07-13 02:24:35,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:24:35,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23203138] [2022-07-13 02:24:35,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:24:35,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:24:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:24:35,838 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:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:24:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23203138] [2022-07-13 02:24:35,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23203138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:24:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488648820] [2022-07-13 02:24:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:24:35,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:24:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:24:35,867 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:24:35,890 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:24:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:24:35,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:24:35,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:24:35,976 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:36,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:24:36,020 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:36,060 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:49,254 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:49,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:24:55,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_921 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_919) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| v_ArrVal_921) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646))) is different from false [2022-07-13 02:24:56,094 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,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488648820] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:24:56,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:24:56,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:24:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150373218] [2022-07-13 02:24:56,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:24:56,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:24:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:24:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:24:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:24:56,096 INFO L87 Difference]: Start difference. First operand 326 states and 698 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:24:56,099 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_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_921 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_919) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| v_ArrVal_921) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646)))) is different from false [2022-07-13 02:25:03,349 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (<= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| Int) (v_ArrVal_921 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218|)) (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| v_ArrVal_921) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646))) (<= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483646) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (v_ArrVal_921 Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |c_~#cache~0.offset|)) (<= (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_921)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646)))) is different from false [2022-07-13 02:25:03,934 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| Int) (v_ArrVal_921 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218|)) (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| v_ArrVal_921) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (v_ArrVal_921 Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |c_~#cache~0.offset|)) (<= (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_921)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646)))) is different from false [2022-07-13 02:25:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:07,989 INFO L93 Difference]: Finished difference Result 349 states and 748 transitions. [2022-07-13 02:25:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 02:25:07,990 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:25:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:07,991 INFO L225 Difference]: With dead ends: 349 [2022-07-13 02:25:07,991 INFO L226 Difference]: Without dead ends: 349 [2022-07-13 02:25:07,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=130, Invalid=360, Unknown=32, NotChecked=180, Total=702 [2022-07-13 02:25:07,991 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:07,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 211 Unchecked, 0.0s Time] [2022-07-13 02:25:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-13 02:25:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 328. [2022-07-13 02:25:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 294 states have (on average 2.3945578231292517) internal successors, (704), 327 states have internal predecessors, (704), 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,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 704 transitions. [2022-07-13 02:25:07,997 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 704 transitions. Word has length 22 [2022-07-13 02:25:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:07,998 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 704 transitions. [2022-07-13 02:25:07,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 704 transitions. [2022-07-13 02:25:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:07,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:07,998 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:08,015 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:25:08,209 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,SelfDestructingSolverStorable23 [2022-07-13 02:25:08,210 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:25:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1944917779, now seen corresponding path program 2 times [2022-07-13 02:25:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:08,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288408524] [2022-07-13 02:25:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:08,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:08,317 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:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:08,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288408524] [2022-07-13 02:25:08,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288408524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:25:08,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428101437] [2022-07-13 02:25:08,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:25:08,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:08,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:25:08,332 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:25:08,375 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:25:08,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:25:08,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:25:08,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:25:08,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:25:08,461 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:08,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:25:08,506 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:08,574 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:19,761 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:19,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:25:27,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_151| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222| Int) (v_ArrVal_993 (Array Int Int)) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_151|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222| v_ArrVal_994) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_151| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))) is different from false [2022-07-13 02:25:27,350 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:27,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428101437] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:25:27,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:25:27,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:25:27,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599413073] [2022-07-13 02:25:27,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:25:27,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:25:27,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:25:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:25:27,351 INFO L87 Difference]: Start difference. First operand 328 states and 704 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:27,356 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_994 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_151| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222| Int) (v_ArrVal_993 (Array Int Int)) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_151|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222| v_ArrVal_994) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_151| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))) (= |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:25:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:27,996 INFO L93 Difference]: Finished difference Result 347 states and 727 transitions. [2022-07-13 02:25:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:25:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:25:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:27,998 INFO L225 Difference]: With dead ends: 347 [2022-07-13 02:25:27,998 INFO L226 Difference]: Without dead ends: 347 [2022-07-13 02:25:27,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=94, Invalid=236, Unknown=20, NotChecked=70, Total=420 [2022-07-13 02:25:27,998 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:27,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 336 Unchecked, 0.1s Time] [2022-07-13 02:25:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-13 02:25:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 327. [2022-07-13 02:25:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 293 states have (on average 2.3959044368600684) internal successors, (702), 326 states have internal predecessors, (702), 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:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 702 transitions. [2022-07-13 02:25:28,012 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 702 transitions. Word has length 22 [2022-07-13 02:25:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:28,012 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 702 transitions. [2022-07-13 02:25:28,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 702 transitions. [2022-07-13 02:25:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:28,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:28,013 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:28,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 02:25:28,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-13 02:25:28,214 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:25:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1944887609, now seen corresponding path program 1 times [2022-07-13 02:25:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:28,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21653439] [2022-07-13 02:25:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 02:25:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:28,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21653439] [2022-07-13 02:25:28,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21653439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:25:28,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:25:28,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:25:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702657110] [2022-07-13 02:25:28,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:25:28,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:25:28,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:28,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:25:28,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:25:28,245 INFO L87 Difference]: Start difference. First operand 327 states and 702 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:28,287 INFO L93 Difference]: Finished difference Result 308 states and 662 transitions. [2022-07-13 02:25:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:25:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:25:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:28,289 INFO L225 Difference]: With dead ends: 308 [2022-07-13 02:25:28,289 INFO L226 Difference]: Without dead ends: 308 [2022-07-13 02:25:28,289 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:25:28,289 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:28,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:25:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-13 02:25:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-07-13 02:25:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 281 states have (on average 2.3558718861209966) internal successors, (662), 307 states have internal predecessors, (662), 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:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 662 transitions. [2022-07-13 02:25:28,304 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 662 transitions. Word has length 22 [2022-07-13 02:25:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:28,304 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 662 transitions. [2022-07-13 02:25:28,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 662 transitions. [2022-07-13 02:25:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:28,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:28,305 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:28,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 02:25:28,305 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:25:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:28,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1944887634, now seen corresponding path program 1 times [2022-07-13 02:25:28,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:28,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603611457] [2022-07-13 02:25:28,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:28,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:25:28,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:28,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603611457] [2022-07-13 02:25:28,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603611457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:25:28,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:25:28,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:25:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635143083] [2022-07-13 02:25:28,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:25:28,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:25:28,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:25:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:25:28,329 INFO L87 Difference]: Start difference. First operand 308 states and 662 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:28,372 INFO L93 Difference]: Finished difference Result 289 states and 622 transitions. [2022-07-13 02:25:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:25:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:25:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:28,374 INFO L225 Difference]: With dead ends: 289 [2022-07-13 02:25:28,374 INFO L226 Difference]: Without dead ends: 289 [2022-07-13 02:25:28,374 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:25:28,375 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:28,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:25:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-13 02:25:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 243. [2022-07-13 02:25:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 223 states have (on average 2.304932735426009) internal successors, (514), 242 states have internal predecessors, (514), 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:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 514 transitions. [2022-07-13 02:25:28,379 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 514 transitions. Word has length 22 [2022-07-13 02:25:28,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:28,380 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 514 transitions. [2022-07-13 02:25:28,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 514 transitions. [2022-07-13 02:25:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:28,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:28,380 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:28,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 02:25:28,381 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:25:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1944583909, now seen corresponding path program 3 times [2022-07-13 02:25:28,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:28,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269481061] [2022-07-13 02:25:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:28,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:28,461 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:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:28,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269481061] [2022-07-13 02:25:28,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269481061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:25:28,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401243571] [2022-07-13 02:25:28,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:25:28,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:25:28,463 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:25:28,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 02:25:28,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 02:25:28,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:25:28,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 02:25:28,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:25:28,591 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:28,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:25:28,637 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:28,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:31,758 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:31,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:25:50,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_t_funThread1of1ForFork0_~i~0#1_155| Int) (v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| (* |v_t_funThread1of1ForFork0_~i~0#1_155| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225|) 2147483646) (not (<= 1 |v_t_funThread1of1ForFork0_~i~0#1_155|)))) is different from false [2022-07-13 02:25:50,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:50,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401243571] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:25:50,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:25:50,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 20 [2022-07-13 02:25:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099412912] [2022-07-13 02:25:50,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:25:50,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 02:25:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 02:25:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=292, Unknown=25, NotChecked=38, Total=462 [2022-07-13 02:25:50,626 INFO L87 Difference]: Start difference. First operand 243 states and 514 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:50,630 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_t_funThread1of1ForFork0_~i~0#1_155| Int) (v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| (* |v_t_funThread1of1ForFork0_~i~0#1_155| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225|) 2147483646) (not (<= 1 |v_t_funThread1of1ForFork0_~i~0#1_155|)))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-13 02:25:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:51,179 INFO L93 Difference]: Finished difference Result 246 states and 520 transitions. [2022-07-13 02:25:51,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:25:51,179 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:25:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:51,180 INFO L225 Difference]: With dead ends: 246 [2022-07-13 02:25:51,180 INFO L226 Difference]: Without dead ends: 246 [2022-07-13 02:25:51,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=116, Invalid=328, Unknown=26, NotChecked=82, Total=552 [2022-07-13 02:25:51,181 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:51,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 230 Unchecked, 0.1s Time] [2022-07-13 02:25:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-13 02:25:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 239. [2022-07-13 02:25:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 219 states have (on average 2.3013698630136985) internal successors, (504), 238 states have internal predecessors, (504), 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:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 504 transitions. [2022-07-13 02:25:51,185 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 504 transitions. Word has length 22 [2022-07-13 02:25:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:51,185 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 504 transitions. [2022-07-13 02:25:51,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 504 transitions. [2022-07-13 02:25:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:51,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:51,185 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:51,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 02:25:51,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-13 02:25:51,402 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:25:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1598488545, now seen corresponding path program 1 times [2022-07-13 02:25:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:51,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756331098] [2022-07-13 02:25:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:51,505 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:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756331098] [2022-07-13 02:25:51,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756331098] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:25:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624323834] [2022-07-13 02:25:51,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:25:51,507 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:25:51,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 02:25:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:51,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:25:51,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:25:51,612 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:51,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:25:51,668 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:51,707 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:04,815 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:04,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:26:11,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1217 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147| Int) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_135| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146|) (+ (* |v_ULTIMATE.start_main_~i~2#1_135| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_135|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1215) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147| v_ArrVal_1217) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146|) 2147483646))) is different from false [2022-07-13 02:26:11,360 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:11,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624323834] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:26:11,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:26:11,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:26:11,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045121789] [2022-07-13 02:26:11,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:26:11,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:26:11,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:26:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:26:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-13 02:26:11,362 INFO L87 Difference]: Start difference. First operand 239 states and 504 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:11,366 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_~#t1~0#1.base_49| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1217 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147| Int) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_135| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146|) (+ (* |v_ULTIMATE.start_main_~i~2#1_135| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_135|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1215) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147| v_ArrVal_1217) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146|) 2147483646)))) is different from false [2022-07-13 02:26:20,531 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 02:26:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:26:26,349 INFO L93 Difference]: Finished difference Result 277 states and 579 transitions. [2022-07-13 02:26:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 02:26:26,349 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:26:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:26:26,350 INFO L225 Difference]: With dead ends: 277 [2022-07-13 02:26:26,350 INFO L226 Difference]: Without dead ends: 277 [2022-07-13 02:26:26,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=134, Invalid=357, Unknown=23, NotChecked=86, Total=600 [2022-07-13 02:26:26,351 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:26:26,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 207 Unchecked, 0.1s Time] [2022-07-13 02:26:26,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-13 02:26:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 240. [2022-07-13 02:26:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 220 states have (on average 2.3) internal successors, (506), 239 states have internal predecessors, (506), 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:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 506 transitions. [2022-07-13 02:26:26,355 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 506 transitions. Word has length 22 [2022-07-13 02:26:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:26:26,355 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 506 transitions. [2022-07-13 02:26:26,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 506 transitions. [2022-07-13 02:26:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:26:26,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:26:26,355 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:26:26,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 02:26:26,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:26:26,556 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:26:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:26:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash -59531411, now seen corresponding path program 2 times [2022-07-13 02:26:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:26:26,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791213238] [2022-07-13 02:26:26,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:26:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:26:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:26:26,639 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:26,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:26:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791213238] [2022-07-13 02:26:26,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791213238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:26:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766033051] [2022-07-13 02:26:26,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:26:26,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:26:26,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:26:26,642 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:26:26,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 02:26:26,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:26:26,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:26:26,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:26:26,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:26:26,753 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:26,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:26:26,800 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:26,845 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:37,555 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:37,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:26:44,493 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_139| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int) (v_ArrVal_1290 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_139|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| (* |v_ULTIMATE.start_main_~i~2#1_139| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1289) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1290) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149|) 2147483646))) is different from false [2022-07-13 02:26:44,592 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:44,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766033051] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:26:44,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:26:44,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:26:44,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35776356] [2022-07-13 02:26:44,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:26:44,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:26:44,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:26:44,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:26:44,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:26:44,594 INFO L87 Difference]: Start difference. First operand 240 states and 506 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:44,599 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~2#1_139| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int) (v_ArrVal_1290 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_139|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| (* |v_ULTIMATE.start_main_~i~2#1_139| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1289) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1290) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149|) 2147483646))) (= |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:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:26:52,589 INFO L93 Difference]: Finished difference Result 271 states and 564 transitions. [2022-07-13 02:26:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 02:26:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:26:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:26:52,591 INFO L225 Difference]: With dead ends: 271 [2022-07-13 02:26:52,591 INFO L226 Difference]: Without dead ends: 271 [2022-07-13 02:26:52,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=131, Invalid=362, Unknown=21, NotChecked=86, Total=600 [2022-07-13 02:26:52,591 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:26:52,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 336 Unchecked, 0.1s Time] [2022-07-13 02:26:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-13 02:26:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 235. [2022-07-13 02:26:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 215 states have (on average 2.302325581395349) internal successors, (495), 234 states have internal predecessors, (495), 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:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 495 transitions. [2022-07-13 02:26:52,596 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 495 transitions. Word has length 22 [2022-07-13 02:26:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:26:52,596 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 495 transitions. [2022-07-13 02:26:52,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 495 transitions. [2022-07-13 02:26:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:26:52,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:26:52,597 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 02:26:52,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 02:26:52,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:26:52,813 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:26:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:26:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -59577185, now seen corresponding path program 1 times [2022-07-13 02:26:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:26:52,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021959944] [2022-07-13 02:26:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:26:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:26:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:26:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:26:52,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:26:52,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021959944] [2022-07-13 02:26:52,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021959944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:26:52,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:26:52,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:26:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440266905] [2022-07-13 02:26:52,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:26:52,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:26:52,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:26:52,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:26:52,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:26:52,856 INFO L87 Difference]: Start difference. First operand 235 states and 495 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:26:52,891 INFO L93 Difference]: Finished difference Result 226 states and 476 transitions. [2022-07-13 02:26:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:26:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:26:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:26:52,892 INFO L225 Difference]: With dead ends: 226 [2022-07-13 02:26:52,892 INFO L226 Difference]: Without dead ends: 226 [2022-07-13 02:26:52,894 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:26:52,895 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:26:52,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:26:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-13 02:26:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-07-13 02:26:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 2.277511961722488) internal successors, (476), 225 states have internal predecessors, (476), 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:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 476 transitions. [2022-07-13 02:26:52,899 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 476 transitions. Word has length 22 [2022-07-13 02:26:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:26:52,899 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 476 transitions. [2022-07-13 02:26:52,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 476 transitions. [2022-07-13 02:26:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:26:52,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:26:52,900 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 02:26:52,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 02:26:52,900 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:26:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:26:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -59577184, now seen corresponding path program 1 times [2022-07-13 02:26:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:26:52,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843011137] [2022-07-13 02:26:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:26:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:26:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:26:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-13 02:26:52,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:26:52,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843011137] [2022-07-13 02:26:52,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843011137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:26:52,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:26:52,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:26:52,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055077084] [2022-07-13 02:26:52,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:26:52,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:26:52,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:26:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:26:52,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:26:52,923 INFO L87 Difference]: Start difference. First operand 226 states and 476 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:26:52,959 INFO L93 Difference]: Finished difference Result 217 states and 457 transitions. [2022-07-13 02:26:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:26:52,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 02:26:52,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:26:52,961 INFO L225 Difference]: With dead ends: 217 [2022-07-13 02:26:52,961 INFO L226 Difference]: Without dead ends: 217 [2022-07-13 02:26:52,961 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:26:52,962 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:26:52,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:26:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-13 02:26:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 193. [2022-07-13 02:26:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 179 states have (on average 2.2458100558659218) internal successors, (402), 192 states have internal predecessors, (402), 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:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 402 transitions. [2022-07-13 02:26:52,966 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 402 transitions. Word has length 22 [2022-07-13 02:26:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:26:52,967 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 402 transitions. [2022-07-13 02:26:52,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:26:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 402 transitions. [2022-07-13 02:26:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:26:52,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:26:52,967 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:26:52,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 02:26:52,968 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:26:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:26:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash -60783191, now seen corresponding path program 3 times [2022-07-13 02:26:52,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:26:52,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209537955] [2022-07-13 02:26:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:26:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:26:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:26:53,063 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:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:26:53,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209537955] [2022-07-13 02:26:53,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209537955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:26:53,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310794437] [2022-07-13 02:26:53,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:26:53,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:26:53,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:26:53,066 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:26:53,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 02:26:53,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 02:26:53,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:26:53,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:26:53,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:26:53,191 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:53,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:26:53,241 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:53,280 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