./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version ff03de63 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 20:52:35,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 20:52:35,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 20:52:35,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 20:52:35,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 20:52:35,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 20:52:35,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 20:52:35,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 20:52:35,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 20:52:35,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 20:52:35,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 20:52:35,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 20:52:35,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 20:52:35,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 20:52:35,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 20:52:35,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 20:52:35,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 20:52:35,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 20:52:35,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 20:52:35,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 20:52:35,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 20:52:35,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 20:52:35,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 20:52:35,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 20:52:35,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 20:52:35,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 20:52:35,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 20:52:35,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 20:52:35,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 20:52:35,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 20:52:35,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 20:52:35,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 20:52:35,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 20:52:35,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 20:52:35,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 20:52:35,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 20:52:35,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 20:52:35,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 20:52:35,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 20:52:35,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 20:52:35,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 20:52:35,804 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2021-12-21 20:52:35,834 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 20:52:35,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 20:52:35,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 20:52:35,835 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 20:52:35,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 20:52:35,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 20:52:35,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 20:52:35,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 20:52:35,837 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 20:52:35,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 20:52:35,838 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 20:52:35,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 20:52:35,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 20:52:35,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 20:52:35,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 20:52:35,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 20:52:35,839 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-21 20:52:35,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 20:52:35,839 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 20:52:35,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 20:52:35,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 20:52:35,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 20:52:35,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 20:52:35,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:52:35,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 20:52:35,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 20:52:35,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 20:52:35,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 20:52:35,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 20:52:35,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 20:52:35,841 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 20:52:35,842 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c899d9f75a53a80fe85551911016ababc48d03a22c1656000243377f27dbc4c0 [2021-12-21 20:52:36,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 20:52:36,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 20:52:36,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 20:52:36,091 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 20:52:36,095 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 20:52:36,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-21 20:52:36,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5a3aa46/506af5d0d2d64f068952b1c38cd7bc37/FLAG6947f3e21 [2021-12-21 20:52:36,640 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 20:52:36,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2021-12-21 20:52:36,670 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5a3aa46/506af5d0d2d64f068952b1c38cd7bc37/FLAG6947f3e21 [2021-12-21 20:52:37,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5a3aa46/506af5d0d2d64f068952b1c38cd7bc37 [2021-12-21 20:52:37,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 20:52:37,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 20:52:37,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 20:52:37,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 20:52:37,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 20:52:37,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:37,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589da81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37, skipping insertion in model container [2021-12-21 20:52:37,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:37,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 20:52:37,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:52:37,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-21 20:52:37,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:52:37,714 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 20:52:37,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i[58078,58091] [2021-12-21 20:52:37,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:52:37,859 INFO L208 MainTranslator]: Completed translation [2021-12-21 20:52:37,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37 WrapperNode [2021-12-21 20:52:37,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 20:52:37,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 20:52:37,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 20:52:37,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 20:52:37,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:37,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:37,986 INFO L137 Inliner]: procedures = 347, calls = 114, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 390 [2021-12-21 20:52:37,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 20:52:37,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 20:52:37,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 20:52:37,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 20:52:37,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:37,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:38,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:38,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:38,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:38,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:38,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:38,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 20:52:38,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 20:52:38,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 20:52:38,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 20:52:38,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (1/1) ... [2021-12-21 20:52:38,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:52:38,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:38,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 20:52:38,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 20:52:38,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-21 20:52:38,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-21 20:52:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 20:52:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 20:52:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 20:52:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 20:52:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 20:52:38,147 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2021-12-21 20:52:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 20:52:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 20:52:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 20:52:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 20:52:38,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 20:52:38,439 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 20:52:38,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 20:52:38,729 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 20:52:38,734 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 20:52:38,734 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-21 20:52:38,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:52:38 BoogieIcfgContainer [2021-12-21 20:52:38,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 20:52:38,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 20:52:38,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 20:52:38,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 20:52:38,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:52:37" (1/3) ... [2021-12-21 20:52:38,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125c5309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:52:38, skipping insertion in model container [2021-12-21 20:52:38,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:37" (2/3) ... [2021-12-21 20:52:38,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125c5309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:52:38, skipping insertion in model container [2021-12-21 20:52:38,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:52:38" (3/3) ... [2021-12-21 20:52:38,743 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-2.i [2021-12-21 20:52:38,747 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 20:52:38,747 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2021-12-21 20:52:38,792 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 20:52:38,800 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 20:52:38,800 INFO L340 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2021-12-21 20:52:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 94 states have (on average 1.7340425531914894) internal successors, (163), 118 states have internal predecessors, (163), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 20:52:38,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:38,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 20:52:38,832 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-12-21 20:52:38,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:38,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896783096] [2021-12-21 20:52:38,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:38,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:39,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:39,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896783096] [2021-12-21 20:52:39,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896783096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:39,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:39,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:52:39,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659331307] [2021-12-21 20:52:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:39,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:52:39,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:39,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:52:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:39,213 INFO L87 Difference]: Start difference. First operand has 122 states, 94 states have (on average 1.7340425531914894) internal successors, (163), 118 states have internal predecessors, (163), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:52:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:39,290 INFO L93 Difference]: Finished difference Result 240 states and 331 transitions. [2021-12-21 20:52:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:52:39,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-21 20:52:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:39,300 INFO L225 Difference]: With dead ends: 240 [2021-12-21 20:52:39,300 INFO L226 Difference]: Without dead ends: 119 [2021-12-21 20:52:39,302 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:52:39,305 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:39,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 296 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-21 20:52:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-12-21 20:52:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.608695652173913) internal successors, (148), 115 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 152 transitions. [2021-12-21 20:52:39,342 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 152 transitions. Word has length 4 [2021-12-21 20:52:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:39,343 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 152 transitions. [2021-12-21 20:52:39,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:52:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2021-12-21 20:52:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-21 20:52:39,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:39,344 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-12-21 20:52:39,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 20:52:39,345 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1809705867, now seen corresponding path program 1 times [2021-12-21 20:52:39,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:39,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446409316] [2021-12-21 20:52:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:39,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 20:52:39,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:39,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446409316] [2021-12-21 20:52:39,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446409316] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:39,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:39,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:52:39,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813306566] [2021-12-21 20:52:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:39,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:52:39,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:52:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:39,405 INFO L87 Difference]: Start difference. First operand 119 states and 152 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2021-12-21 20:52:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:39,422 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2021-12-21 20:52:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:52:39,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 7 [2021-12-21 20:52:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:39,424 INFO L225 Difference]: With dead ends: 119 [2021-12-21 20:52:39,425 INFO L226 Difference]: Without dead ends: 118 [2021-12-21 20:52:39,425 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:52:39,426 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:39,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-21 20:52:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-12-21 20:52:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 114 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 151 transitions. [2021-12-21 20:52:39,435 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 151 transitions. Word has length 7 [2021-12-21 20:52:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:39,436 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 151 transitions. [2021-12-21 20:52:39,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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) [2021-12-21 20:52:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 151 transitions. [2021-12-21 20:52:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-21 20:52:39,437 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:39,437 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2021-12-21 20:52:39,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 20:52:39,437 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash 266307074, now seen corresponding path program 1 times [2021-12-21 20:52:39,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:39,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475745031] [2021-12-21 20:52:39,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:39,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:39,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:39,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475745031] [2021-12-21 20:52:39,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475745031] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:39,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215704683] [2021-12-21 20:52:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:39,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:39,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:39,499 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:39,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 20:52:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:39,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:39,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:39,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:52:39,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215704683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:39,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:52:39,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-12-21 20:52:39,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179428587] [2021-12-21 20:52:39,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:39,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:52:39,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:39,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:52:39,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:39,677 INFO L87 Difference]: Start difference. First operand 118 states and 151 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:52:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:39,708 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2021-12-21 20:52:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:52:39,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-21 20:52:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:39,713 INFO L225 Difference]: With dead ends: 118 [2021-12-21 20:52:39,713 INFO L226 Difference]: Without dead ends: 117 [2021-12-21 20:52:39,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:39,716 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 135 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:39,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 155 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-21 20:52:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2021-12-21 20:52:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 90 states have (on average 1.6) internal successors, (144), 111 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 148 transitions. [2021-12-21 20:52:39,735 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 148 transitions. Word has length 8 [2021-12-21 20:52:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:39,736 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 148 transitions. [2021-12-21 20:52:39,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:52:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 148 transitions. [2021-12-21 20:52:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 20:52:39,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:39,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:39,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:39,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:39,954 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:39,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1917485634, now seen corresponding path program 1 times [2021-12-21 20:52:39,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:39,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132019586] [2021-12-21 20:52:39,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:39,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 20:52:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:40,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:40,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132019586] [2021-12-21 20:52:40,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132019586] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:40,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467357032] [2021-12-21 20:52:40,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:40,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:40,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:40,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 20:52:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:40,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:40,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:40,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:40,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467357032] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:52:40,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:52:40,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-21 20:52:40,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295834150] [2021-12-21 20:52:40,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:52:40,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:52:40,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:40,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:52:40,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:40,249 INFO L87 Difference]: Start difference. First operand 115 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 20:52:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:40,275 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2021-12-21 20:52:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:52:40,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2021-12-21 20:52:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:40,277 INFO L225 Difference]: With dead ends: 233 [2021-12-21 20:52:40,277 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 20:52:40,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:40,278 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 8 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:40,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 712 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 20:52:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-21 20:52:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 99 states have (on average 1.5454545454545454) internal successors, (153), 120 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2021-12-21 20:52:40,286 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 13 [2021-12-21 20:52:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:40,286 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2021-12-21 20:52:40,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 20:52:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2021-12-21 20:52:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 20:52:40,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:40,288 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:40,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:40,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-21 20:52:40,516 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 680695804, now seen corresponding path program 2 times [2021-12-21 20:52:40,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:40,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092451812] [2021-12-21 20:52:40,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:40,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:40,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:52:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:40,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:40,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092451812] [2021-12-21 20:52:40,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092451812] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:40,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99711788] [2021-12-21 20:52:40,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:52:40,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:40,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:40,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 20:52:40,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:52:40,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:52:40,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 20:52:40,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 20:52:40,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:52:40,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99711788] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:40,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:52:40,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-21 20:52:40,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000596583] [2021-12-21 20:52:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:40,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:52:40,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:40,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:52:40,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:52:40,822 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:40,871 INFO L93 Difference]: Finished difference Result 124 states and 157 transitions. [2021-12-21 20:52:40,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 20:52:40,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-12-21 20:52:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:40,872 INFO L225 Difference]: With dead ends: 124 [2021-12-21 20:52:40,872 INFO L226 Difference]: Without dead ends: 120 [2021-12-21 20:52:40,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:52:40,874 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 131 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:40,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 397 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-21 20:52:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-12-21 20:52:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.505050505050505) internal successors, (149), 116 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2021-12-21 20:52:40,881 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 22 [2021-12-21 20:52:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:40,883 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2021-12-21 20:52:40,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2021-12-21 20:52:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 20:52:40,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:40,884 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:40,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-21 20:52:41,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:41,096 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:41,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash 838721298, now seen corresponding path program 1 times [2021-12-21 20:52:41,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:41,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332503278] [2021-12-21 20:52:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:41,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:52:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 20:52:41,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:41,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332503278] [2021-12-21 20:52:41,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332503278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:41,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:41,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:52:41,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422620703] [2021-12-21 20:52:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:41,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:52:41,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:41,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:52:41,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:41,214 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:41,232 INFO L93 Difference]: Finished difference Result 222 states and 289 transitions. [2021-12-21 20:52:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:52:41,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-12-21 20:52:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:41,233 INFO L225 Difference]: With dead ends: 222 [2021-12-21 20:52:41,233 INFO L226 Difference]: Without dead ends: 123 [2021-12-21 20:52:41,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:41,237 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 2 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:41,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-21 20:52:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-12-21 20:52:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4901960784313726) internal successors, (152), 119 states have internal predecessors, (152), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 156 transitions. [2021-12-21 20:52:41,249 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 156 transitions. Word has length 28 [2021-12-21 20:52:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:41,249 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 156 transitions. [2021-12-21 20:52:41,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 156 transitions. [2021-12-21 20:52:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 20:52:41,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:41,251 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:41,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 20:52:41,252 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1771822670, now seen corresponding path program 1 times [2021-12-21 20:52:41,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:41,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280451650] [2021-12-21 20:52:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:41,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:52:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-21 20:52:41,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:41,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280451650] [2021-12-21 20:52:41,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280451650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:41,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:41,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:52:41,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983575304] [2021-12-21 20:52:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:41,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:52:41,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:41,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:52:41,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:41,382 INFO L87 Difference]: Start difference. First operand 123 states and 156 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:41,407 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2021-12-21 20:52:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:52:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-12-21 20:52:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:41,408 INFO L225 Difference]: With dead ends: 221 [2021-12-21 20:52:41,408 INFO L226 Difference]: Without dead ends: 219 [2021-12-21 20:52:41,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:41,409 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 117 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:41,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 273 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-21 20:52:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 132. [2021-12-21 20:52:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.4864864864864864) internal successors, (165), 128 states have internal predecessors, (165), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2021-12-21 20:52:41,416 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 31 [2021-12-21 20:52:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:41,417 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2021-12-21 20:52:41,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:41,417 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2021-12-21 20:52:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 20:52:41,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:41,418 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:41,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 20:52:41,418 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1771822615, now seen corresponding path program 1 times [2021-12-21 20:52:41,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:41,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024080616] [2021-12-21 20:52:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:41,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:52:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-21 20:52:41,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:41,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024080616] [2021-12-21 20:52:41,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024080616] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:41,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:41,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:52:41,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637711379] [2021-12-21 20:52:41,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:41,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:52:41,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:41,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:52:41,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:41,503 INFO L87 Difference]: Start difference. First operand 132 states and 169 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:41,516 INFO L93 Difference]: Finished difference Result 132 states and 169 transitions. [2021-12-21 20:52:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:52:41,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-12-21 20:52:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:41,517 INFO L225 Difference]: With dead ends: 132 [2021-12-21 20:52:41,517 INFO L226 Difference]: Without dead ends: 131 [2021-12-21 20:52:41,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:41,518 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 2 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:41,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 273 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-21 20:52:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-21 20:52:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 127 states have internal predecessors, (163), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 167 transitions. [2021-12-21 20:52:41,524 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 167 transitions. Word has length 31 [2021-12-21 20:52:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:41,526 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 167 transitions. [2021-12-21 20:52:41,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2021-12-21 20:52:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 20:52:41,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:41,530 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:41,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 20:52:41,531 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash -307479222, now seen corresponding path program 1 times [2021-12-21 20:52:41,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:41,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997068527] [2021-12-21 20:52:41,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:41,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:52:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 20:52:41,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:41,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997068527] [2021-12-21 20:52:41,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997068527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:41,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:41,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:52:41,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433744779] [2021-12-21 20:52:41,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:41,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:52:41,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:41,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:52:41,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:41,618 INFO L87 Difference]: Start difference. First operand 131 states and 167 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:41,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:41,631 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2021-12-21 20:52:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:52:41,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-12-21 20:52:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:41,632 INFO L225 Difference]: With dead ends: 136 [2021-12-21 20:52:41,632 INFO L226 Difference]: Without dead ends: 134 [2021-12-21 20:52:41,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:41,634 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:41,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-21 20:52:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-12-21 20:52:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.456140350877193) internal successors, (166), 130 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2021-12-21 20:52:41,640 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 32 [2021-12-21 20:52:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:41,640 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2021-12-21 20:52:41,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2021-12-21 20:52:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 20:52:41,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:41,643 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:41,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 20:52:41,644 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:41,644 INFO L85 PathProgramCache]: Analyzing trace with hash -393488939, now seen corresponding path program 1 times [2021-12-21 20:52:41,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:41,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261145264] [2021-12-21 20:52:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:41,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-21 20:52:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:41,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261145264] [2021-12-21 20:52:41,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261145264] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:41,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133450577] [2021-12-21 20:52:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:41,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:41,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:41,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 20:52:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:41,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 20:52:41,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:42,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:52:42,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133450577] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:52:42,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:52:42,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-21 20:52:42,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932716698] [2021-12-21 20:52:42,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:52:42,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 20:52:42,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:42,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 20:52:42,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:52:42,147 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 20:52:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:42,207 INFO L93 Difference]: Finished difference Result 271 states and 348 transitions. [2021-12-21 20:52:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 20:52:42,207 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-21 20:52:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:42,208 INFO L225 Difference]: With dead ends: 271 [2021-12-21 20:52:42,208 INFO L226 Difference]: Without dead ends: 152 [2021-12-21 20:52:42,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:52:42,210 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:42,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 413 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-21 20:52:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-21 20:52:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 132 states have (on average 1.393939393939394) internal successors, (184), 148 states have internal predecessors, (184), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2021-12-21 20:52:42,217 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 32 [2021-12-21 20:52:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:42,218 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2021-12-21 20:52:42,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 20:52:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2021-12-21 20:52:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-21 20:52:42,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:42,220 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:42,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:42,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:42,431 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -612238187, now seen corresponding path program 2 times [2021-12-21 20:52:42,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:42,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374742712] [2021-12-21 20:52:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:42,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:42,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:42,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:42,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374742712] [2021-12-21 20:52:42,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374742712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:42,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:42,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:52:42,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927923899] [2021-12-21 20:52:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:42,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:52:42,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:42,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:52:42,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:42,543 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:42,551 INFO L93 Difference]: Finished difference Result 270 states and 350 transitions. [2021-12-21 20:52:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:52:42,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-12-21 20:52:42,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:42,552 INFO L225 Difference]: With dead ends: 270 [2021-12-21 20:52:42,553 INFO L226 Difference]: Without dead ends: 183 [2021-12-21 20:52:42,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:52:42,553 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 79 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:42,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 289 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-21 20:52:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 129. [2021-12-21 20:52:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 125 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2021-12-21 20:52:42,559 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 50 [2021-12-21 20:52:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:42,559 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2021-12-21 20:52:42,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2021-12-21 20:52:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-21 20:52:42,560 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:42,560 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:42,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 20:52:42,560 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 689324614, now seen corresponding path program 1 times [2021-12-21 20:52:42,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:42,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651632823] [2021-12-21 20:52:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:42,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:42,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:42,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:42,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651632823] [2021-12-21 20:52:42,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651632823] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:42,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691899682] [2021-12-21 20:52:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:42,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:42,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:42,672 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:42,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 20:52:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:42,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:42,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:42,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:52:42,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691899682] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:42,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:52:42,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-12-21 20:52:42,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884257589] [2021-12-21 20:52:42,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:42,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:52:42,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:42,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:52:42,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:42,996 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:43,023 INFO L93 Difference]: Finished difference Result 194 states and 248 transitions. [2021-12-21 20:52:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:52:43,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-12-21 20:52:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:43,025 INFO L225 Difference]: With dead ends: 194 [2021-12-21 20:52:43,025 INFO L226 Difference]: Without dead ends: 193 [2021-12-21 20:52:43,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:43,025 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 180 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:43,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-21 20:52:43,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 124. [2021-12-21 20:52:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 120 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 153 transitions. [2021-12-21 20:52:43,032 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 153 transitions. Word has length 50 [2021-12-21 20:52:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:43,032 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 153 transitions. [2021-12-21 20:52:43,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 153 transitions. [2021-12-21 20:52:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-21 20:52:43,033 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:43,033 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:43,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:43,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-21 20:52:43,253 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:43,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash 51318775, now seen corresponding path program 1 times [2021-12-21 20:52:43,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:43,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431595488] [2021-12-21 20:52:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:43,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:43,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:43,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431595488] [2021-12-21 20:52:43,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431595488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:43,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:43,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:52:43,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161014281] [2021-12-21 20:52:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:43,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:52:43,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:52:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:43,394 INFO L87 Difference]: Start difference. First operand 124 states and 153 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:43,464 INFO L93 Difference]: Finished difference Result 189 states and 242 transitions. [2021-12-21 20:52:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:52:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-12-21 20:52:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:43,466 INFO L225 Difference]: With dead ends: 189 [2021-12-21 20:52:43,466 INFO L226 Difference]: Without dead ends: 188 [2021-12-21 20:52:43,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:43,467 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 246 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:43,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 423 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-21 20:52:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 132. [2021-12-21 20:52:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 128 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2021-12-21 20:52:43,478 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 52 [2021-12-21 20:52:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:43,479 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2021-12-21 20:52:43,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2021-12-21 20:52:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-21 20:52:43,479 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:43,480 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:43,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 20:52:43,480 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash -241356089, now seen corresponding path program 1 times [2021-12-21 20:52:43,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:43,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105608241] [2021-12-21 20:52:43,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:43,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:43,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:43,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105608241] [2021-12-21 20:52:43,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105608241] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:43,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43075716] [2021-12-21 20:52:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:43,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:43,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:43,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:43,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 20:52:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:43,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:52:43,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2021-12-21 20:52:43,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:52:43,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43075716] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:43,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:52:43,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2021-12-21 20:52:43,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079507694] [2021-12-21 20:52:43,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:43,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:52:43,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:43,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:52:43,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:43,899 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:43,958 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2021-12-21 20:52:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 20:52:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-12-21 20:52:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:43,960 INFO L225 Difference]: With dead ends: 188 [2021-12-21 20:52:43,960 INFO L226 Difference]: Without dead ends: 176 [2021-12-21 20:52:43,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:52:43,961 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 160 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:43,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 405 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-21 20:52:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2021-12-21 20:52:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.360248447204969) internal successors, (219), 168 states have internal predecessors, (219), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 225 transitions. [2021-12-21 20:52:43,971 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 225 transitions. Word has length 53 [2021-12-21 20:52:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:43,971 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 225 transitions. [2021-12-21 20:52:43,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2021-12-21 20:52:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-21 20:52:43,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:43,972 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:44,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:44,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:44,187 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1590882203, now seen corresponding path program 1 times [2021-12-21 20:52:44,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:44,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306290553] [2021-12-21 20:52:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:44,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:44,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:44,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306290553] [2021-12-21 20:52:44,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306290553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:44,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:44,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 20:52:44,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28166153] [2021-12-21 20:52:44,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:44,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:52:44,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:44,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:52:44,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:52:44,323 INFO L87 Difference]: Start difference. First operand 173 states and 225 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:44,400 INFO L93 Difference]: Finished difference Result 267 states and 361 transitions. [2021-12-21 20:52:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:52:44,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-12-21 20:52:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:44,401 INFO L225 Difference]: With dead ends: 267 [2021-12-21 20:52:44,401 INFO L226 Difference]: Without dead ends: 266 [2021-12-21 20:52:44,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:52:44,402 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 238 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:44,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 373 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:52:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-21 20:52:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 172. [2021-12-21 20:52:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 161 states have (on average 1.3478260869565217) internal successors, (217), 167 states have internal predecessors, (217), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2021-12-21 20:52:44,411 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 223 transitions. Word has length 53 [2021-12-21 20:52:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:44,411 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 223 transitions. [2021-12-21 20:52:44,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 223 transitions. [2021-12-21 20:52:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-21 20:52:44,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:44,412 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:44,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 20:52:44,412 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -393033958, now seen corresponding path program 1 times [2021-12-21 20:52:44,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:44,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812747315] [2021-12-21 20:52:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:44,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:44,521 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-21 20:52:44,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:44,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812747315] [2021-12-21 20:52:44,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812747315] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:44,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125397731] [2021-12-21 20:52:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:44,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:44,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:44,523 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:44,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 20:52:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:44,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:44,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-21 20:52:44,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-12-21 20:52:44,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125397731] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:52:44,989 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:52:44,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-21 20:52:44,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255519127] [2021-12-21 20:52:44,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:52:44,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:52:44,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:52:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:44,990 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:45,024 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2021-12-21 20:52:45,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:52:45,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-12-21 20:52:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:45,025 INFO L225 Difference]: With dead ends: 269 [2021-12-21 20:52:45,025 INFO L226 Difference]: Without dead ends: 190 [2021-12-21 20:52:45,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:45,026 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 12 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:45,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 318 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-21 20:52:45,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2021-12-21 20:52:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 179 states have (on average 1.312849162011173) internal successors, (235), 185 states have internal predecessors, (235), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 241 transitions. [2021-12-21 20:52:45,035 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 241 transitions. Word has length 56 [2021-12-21 20:52:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:45,035 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 241 transitions. [2021-12-21 20:52:45,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2021-12-21 20:52:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-21 20:52:45,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:45,036 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:45,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-21 20:52:45,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:45,252 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1063722415, now seen corresponding path program 1 times [2021-12-21 20:52:45,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:45,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483364755] [2021-12-21 20:52:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:45,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:45,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:45,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483364755] [2021-12-21 20:52:45,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483364755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:45,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622991211] [2021-12-21 20:52:45,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:45,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:45,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:45,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:45,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 20:52:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:45,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 20:52:45,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:45,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2021-12-21 20:52:45,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622991211] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:52:45,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:52:45,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-21 20:52:45,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909721604] [2021-12-21 20:52:45,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:52:45,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 20:52:45,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 20:52:45,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:52:45,967 INFO L87 Difference]: Start difference. First operand 190 states and 241 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:46,024 INFO L93 Difference]: Finished difference Result 314 states and 402 transitions. [2021-12-21 20:52:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 20:52:46,025 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-12-21 20:52:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:46,026 INFO L225 Difference]: With dead ends: 314 [2021-12-21 20:52:46,026 INFO L226 Difference]: Without dead ends: 226 [2021-12-21 20:52:46,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:52:46,027 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 30 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:46,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 528 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-21 20:52:46,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-12-21 20:52:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 215 states have (on average 1.2604651162790699) internal successors, (271), 221 states have internal predecessors, (271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2021-12-21 20:52:46,044 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 68 [2021-12-21 20:52:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:46,045 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2021-12-21 20:52:46,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2021-12-21 20:52:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-21 20:52:46,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:46,045 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:46,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:46,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 20:52:46,268 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2004228324, now seen corresponding path program 1 times [2021-12-21 20:52:46,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:46,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827886915] [2021-12-21 20:52:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:46,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 20:52:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-12-21 20:52:46,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:46,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827886915] [2021-12-21 20:52:46,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827886915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:46,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:46,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:52:46,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417143217] [2021-12-21 20:52:46,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:46,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 20:52:46,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:46,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 20:52:46,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:52:46,443 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:46,559 INFO L93 Difference]: Finished difference Result 296 states and 362 transitions. [2021-12-21 20:52:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 20:52:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-12-21 20:52:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:46,561 INFO L225 Difference]: With dead ends: 296 [2021-12-21 20:52:46,561 INFO L226 Difference]: Without dead ends: 285 [2021-12-21 20:52:46,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:52:46,562 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 100 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:46,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 569 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:52:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-12-21 20:52:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 253. [2021-12-21 20:52:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 240 states have (on average 1.2666666666666666) internal successors, (304), 246 states have internal predecessors, (304), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:52:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 314 transitions. [2021-12-21 20:52:46,575 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 314 transitions. Word has length 73 [2021-12-21 20:52:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:46,575 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 314 transitions. [2021-12-21 20:52:46,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 314 transitions. [2021-12-21 20:52:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-21 20:52:46,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:46,580 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:46,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 20:52:46,580 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2001535557, now seen corresponding path program 1 times [2021-12-21 20:52:46,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:46,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536792921] [2021-12-21 20:52:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:46,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 20:52:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-12-21 20:52:46,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:46,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536792921] [2021-12-21 20:52:46,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536792921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:46,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:46,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:52:46,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506100009] [2021-12-21 20:52:46,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:46,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:52:46,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:52:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:52:46,698 INFO L87 Difference]: Start difference. First operand 253 states and 314 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:46,722 INFO L93 Difference]: Finished difference Result 267 states and 329 transitions. [2021-12-21 20:52:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:52:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2021-12-21 20:52:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:46,723 INFO L225 Difference]: With dead ends: 267 [2021-12-21 20:52:46,723 INFO L226 Difference]: Without dead ends: 266 [2021-12-21 20:52:46,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:52:46,724 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 18 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:46,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 237 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-21 20:52:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 255. [2021-12-21 20:52:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 242 states have (on average 1.2644628099173554) internal successors, (306), 248 states have internal predecessors, (306), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:52:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 316 transitions. [2021-12-21 20:52:46,736 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 316 transitions. Word has length 74 [2021-12-21 20:52:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:46,736 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 316 transitions. [2021-12-21 20:52:46,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 316 transitions. [2021-12-21 20:52:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-21 20:52:46,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:46,738 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:46,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 20:52:46,738 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:46,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1077583441, now seen corresponding path program 2 times [2021-12-21 20:52:46,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:46,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721394208] [2021-12-21 20:52:46,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:46,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2021-12-21 20:52:46,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:46,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721394208] [2021-12-21 20:52:46,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721394208] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:46,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145509207] [2021-12-21 20:52:46,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:52:46,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:46,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:46,926 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:46,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 20:52:47,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:52:47,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:52:47,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:52:47,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2021-12-21 20:52:47,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:52:47,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145509207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:47,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:52:47,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-12-21 20:52:47,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609742280] [2021-12-21 20:52:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:47,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:52:47,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:47,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:52:47,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:52:47,398 INFO L87 Difference]: Start difference. First operand 255 states and 316 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:47,438 INFO L93 Difference]: Finished difference Result 255 states and 316 transitions. [2021-12-21 20:52:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:52:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2021-12-21 20:52:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:47,440 INFO L225 Difference]: With dead ends: 255 [2021-12-21 20:52:47,440 INFO L226 Difference]: Without dead ends: 254 [2021-12-21 20:52:47,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:52:47,441 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 157 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:47,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-21 20:52:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-12-21 20:52:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 242 states have (on average 1.2603305785123966) internal successors, (305), 247 states have internal predecessors, (305), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:52:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 315 transitions. [2021-12-21 20:52:47,456 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 315 transitions. Word has length 86 [2021-12-21 20:52:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:47,456 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 315 transitions. [2021-12-21 20:52:47,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 315 transitions. [2021-12-21 20:52:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-21 20:52:47,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:47,458 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:47,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:47,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:47,674 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash -877586417, now seen corresponding path program 1 times [2021-12-21 20:52:47,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:47,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386146866] [2021-12-21 20:52:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:47,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:47,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2021-12-21 20:52:47,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386146866] [2021-12-21 20:52:47,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386146866] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:47,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174770533] [2021-12-21 20:52:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:47,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:47,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:47,786 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:47,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 20:52:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:48,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:48,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2021-12-21 20:52:48,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2021-12-21 20:52:48,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174770533] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:52:48,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:52:48,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-12-21 20:52:48,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275596186] [2021-12-21 20:52:48,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:52:48,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:52:48,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:52:48,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:48,418 INFO L87 Difference]: Start difference. First operand 254 states and 315 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:48,453 INFO L93 Difference]: Finished difference Result 263 states and 328 transitions. [2021-12-21 20:52:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 20:52:48,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2021-12-21 20:52:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:48,455 INFO L225 Difference]: With dead ends: 263 [2021-12-21 20:52:48,455 INFO L226 Difference]: Without dead ends: 262 [2021-12-21 20:52:48,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:48,456 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 9 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:48,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 312 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-21 20:52:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2021-12-21 20:52:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 250 states have (on average 1.26) internal successors, (315), 255 states have internal predecessors, (315), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-21 20:52:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 325 transitions. [2021-12-21 20:52:48,471 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 325 transitions. Word has length 87 [2021-12-21 20:52:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:48,472 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 325 transitions. [2021-12-21 20:52:48,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 325 transitions. [2021-12-21 20:52:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-21 20:52:48,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:48,473 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:48,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:48,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-21 20:52:48,687 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1510288111, now seen corresponding path program 1 times [2021-12-21 20:52:48,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:48,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764815566] [2021-12-21 20:52:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:48,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 20:52:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:48,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-21 20:52:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2021-12-21 20:52:48,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:48,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764815566] [2021-12-21 20:52:48,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764815566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:48,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:52:48,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 20:52:48,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188130156] [2021-12-21 20:52:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:48,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:52:48,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:52:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:52:48,906 INFO L87 Difference]: Start difference. First operand 262 states and 325 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:48,982 INFO L93 Difference]: Finished difference Result 268 states and 328 transitions. [2021-12-21 20:52:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:52:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2021-12-21 20:52:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:48,983 INFO L225 Difference]: With dead ends: 268 [2021-12-21 20:52:48,983 INFO L226 Difference]: Without dead ends: 199 [2021-12-21 20:52:48,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:52:48,984 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 129 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:48,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 298 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:52:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-21 20:52:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-12-21 20:52:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 189 states have (on average 1.2116402116402116) internal successors, (229), 194 states have internal predecessors, (229), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 235 transitions. [2021-12-21 20:52:48,996 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 235 transitions. Word has length 90 [2021-12-21 20:52:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:48,996 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 235 transitions. [2021-12-21 20:52:48,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 20:52:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 235 transitions. [2021-12-21 20:52:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-21 20:52:48,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:48,997 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:48,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-21 20:52:48,997 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1435374785, now seen corresponding path program 1 times [2021-12-21 20:52:48,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:48,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893031108] [2021-12-21 20:52:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:48,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:49,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2021-12-21 20:52:49,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893031108] [2021-12-21 20:52:49,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893031108] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000809405] [2021-12-21 20:52:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:49,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:49,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:49,103 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:52:49,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 20:52:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:49,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:49,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2021-12-21 20:52:49,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:52:49,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000809405] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:49,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:52:49,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-12-21 20:52:49,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065008862] [2021-12-21 20:52:49,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:49,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:52:49,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:49,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:52:49,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:49,656 INFO L87 Difference]: Start difference. First operand 199 states and 235 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:49,678 INFO L93 Difference]: Finished difference Result 199 states and 235 transitions. [2021-12-21 20:52:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:52:49,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2021-12-21 20:52:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:49,679 INFO L225 Difference]: With dead ends: 199 [2021-12-21 20:52:49,679 INFO L226 Difference]: Without dead ends: 198 [2021-12-21 20:52:49,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:49,680 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:49,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-21 20:52:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-21 20:52:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 189 states have (on average 1.1957671957671958) internal successors, (226), 193 states have internal predecessors, (226), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 232 transitions. [2021-12-21 20:52:49,692 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 232 transitions. Word has length 88 [2021-12-21 20:52:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:49,692 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 232 transitions. [2021-12-21 20:52:49,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 232 transitions. [2021-12-21 20:52:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-21 20:52:49,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:49,693 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:49,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:49,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-21 20:52:49,916 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 824876418, now seen corresponding path program 2 times [2021-12-21 20:52:49,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994550583] [2021-12-21 20:52:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:49,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2021-12-21 20:52:50,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:50,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994550583] [2021-12-21 20:52:50,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994550583] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:50,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54255765] [2021-12-21 20:52:50,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:52:50,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:50,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:50,070 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) [2021-12-21 20:52:50,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 20:52:50,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:52:50,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:52:50,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:50,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2021-12-21 20:52:50,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2021-12-21 20:52:50,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54255765] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:52:50,812 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:52:50,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-21 20:52:50,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585042042] [2021-12-21 20:52:50,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:52:50,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:52:50,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:52:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:52:50,813 INFO L87 Difference]: Start difference. First operand 198 states and 232 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:50,864 INFO L93 Difference]: Finished difference Result 198 states and 232 transitions. [2021-12-21 20:52:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:52:50,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2021-12-21 20:52:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:50,866 INFO L225 Difference]: With dead ends: 198 [2021-12-21 20:52:50,866 INFO L226 Difference]: Without dead ends: 178 [2021-12-21 20:52:50,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:52:50,867 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:50,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 310 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-21 20:52:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-12-21 20:52:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 170 states have (on average 1.1764705882352942) internal successors, (200), 173 states have internal predecessors, (200), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2021-12-21 20:52:50,877 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 96 [2021-12-21 20:52:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:50,877 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2021-12-21 20:52:50,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2021-12-21 20:52:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-21 20:52:50,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:50,878 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:50,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:51,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-21 20:52:51,096 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash 339028874, now seen corresponding path program 2 times [2021-12-21 20:52:51,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:51,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226468277] [2021-12-21 20:52:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:51,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-12-21 20:52:51,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226468277] [2021-12-21 20:52:51,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226468277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:51,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141775361] [2021-12-21 20:52:51,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:52:51,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:51,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:51,295 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) [2021-12-21 20:52:51,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-21 20:52:51,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 20:52:51,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:52:51,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:51,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2021-12-21 20:52:51,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2021-12-21 20:52:52,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141775361] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:52:52,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:52:52,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2021-12-21 20:52:52,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79331846] [2021-12-21 20:52:52,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:52:52,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 20:52:52,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:52,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 20:52:52,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:52:52,152 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:52,250 INFO L93 Difference]: Finished difference Result 343 states and 424 transitions. [2021-12-21 20:52:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:52:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-12-21 20:52:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:52,252 INFO L225 Difference]: With dead ends: 343 [2021-12-21 20:52:52,252 INFO L226 Difference]: Without dead ends: 342 [2021-12-21 20:52:52,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2021-12-21 20:52:52,253 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 409 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:52,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 397 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:52:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-12-21 20:52:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 177. [2021-12-21 20:52:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 170 states have (on average 1.1705882352941177) internal successors, (199), 172 states have internal predecessors, (199), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2021-12-21 20:52:52,265 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 110 [2021-12-21 20:52:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:52,265 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2021-12-21 20:52:52,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2021-12-21 20:52:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-21 20:52:52,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:52,267 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:52,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:52,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-21 20:52:52,492 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1919960588, now seen corresponding path program 1 times [2021-12-21 20:52:52,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:52,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101674698] [2021-12-21 20:52:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:52,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:52,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-12-21 20:52:52,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:52,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101674698] [2021-12-21 20:52:52,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101674698] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:52,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716233570] [2021-12-21 20:52:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:52,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:52,704 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) [2021-12-21 20:52:52,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-21 20:52:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:53,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 20:52:53,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-12-21 20:52:53,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:52:53,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716233570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:52:53,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:52:53,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2021-12-21 20:52:53,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046476288] [2021-12-21 20:52:53,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:52:53,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:52:53,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:53,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:52:53,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:53,444 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:53,475 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2021-12-21 20:52:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:52:53,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2021-12-21 20:52:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:53,477 INFO L225 Difference]: With dead ends: 177 [2021-12-21 20:52:53,477 INFO L226 Difference]: Without dead ends: 176 [2021-12-21 20:52:53,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:52:53,478 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 140 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:53,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 111 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:52:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-21 20:52:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 143. [2021-12-21 20:52:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 137 states have (on average 1.197080291970803) internal successors, (164), 138 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2021-12-21 20:52:53,496 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 111 [2021-12-21 20:52:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:53,496 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2021-12-21 20:52:53,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-21 20:52:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2021-12-21 20:52:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-12-21 20:52:53,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:53,498 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:53,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:53,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:53,711 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:53,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash -249684791, now seen corresponding path program 1 times [2021-12-21 20:52:53,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:53,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489119839] [2021-12-21 20:52:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:53,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:54,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-21 20:52:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:54,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 20:52:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2021-12-21 20:52:54,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:54,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489119839] [2021-12-21 20:52:54,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489119839] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219030821] [2021-12-21 20:52:54,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:54,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:54,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:54,106 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) [2021-12-21 20:52:54,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 20:52:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:54,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 20:52:54,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2021-12-21 20:52:55,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2021-12-21 20:52:55,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219030821] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:52:55,505 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:52:55,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2021-12-21 20:52:55,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685803489] [2021-12-21 20:52:55,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:52:55,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 20:52:55,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:52:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 20:52:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:52:55,506 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 20:52:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:52:55,708 INFO L93 Difference]: Finished difference Result 280 states and 333 transitions. [2021-12-21 20:52:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:52:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 124 [2021-12-21 20:52:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:52:55,709 INFO L225 Difference]: With dead ends: 280 [2021-12-21 20:52:55,709 INFO L226 Difference]: Without dead ends: 210 [2021-12-21 20:52:55,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2021-12-21 20:52:55,710 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 186 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:52:55,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 528 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:52:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-21 20:52:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 177. [2021-12-21 20:52:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 171 states have (on average 1.1637426900584795) internal successors, (199), 172 states have internal predecessors, (199), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 20:52:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2021-12-21 20:52:55,723 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 124 [2021-12-21 20:52:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:52:55,723 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2021-12-21 20:52:55,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 20:52:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2021-12-21 20:52:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-21 20:52:55,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:52:55,725 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:52:55,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-21 20:52:55,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-21 20:52:55,943 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2021-12-21 20:52:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:52:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1132890495, now seen corresponding path program 2 times [2021-12-21 20:52:55,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:52:55,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297382861] [2021-12-21 20:52:55,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:52:55,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:52:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:57,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-21 20:52:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:57,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-21 20:52:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-21 20:52:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:52:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2021-12-21 20:52:57,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:52:57,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297382861] [2021-12-21 20:52:57,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297382861] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:52:57,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507325922] [2021-12-21 20:52:57,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:52:57,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:52:57,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:52:57,794 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) [2021-12-21 20:52:57,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-21 20:52:58,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 20:52:58,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:52:58,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-21 20:52:58,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:52:58,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 20:52:58,618 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 20:52:58,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 20:52:58,687 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-21 20:52:58,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 20:52:59,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-12-21 20:52:59,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 20:52:59,135 INFO L353 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-21 20:52:59,136 INFO L387 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2021-12-21 20:52:59,150 INFO L353 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2021-12-21 20:52:59,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-12-21 20:52:59,180 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,180 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,224 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,225 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,265 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,266 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,314 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,314 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,354 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,355 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,408 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,409 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,475 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,475 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,521 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,522 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,568 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,569 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,615 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 20:52:59,616 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-21 20:52:59,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 20:52:59,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 20:52:59,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 15 [2021-12-21 20:52:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 8 proven. 354 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2021-12-21 20:52:59,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:52:59,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8129 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|)) v_ArrVal_8129) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:00,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:00,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8127))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:00,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8126))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8127)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:00,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8125))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8126)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8127)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:00,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8124))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8125)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8126)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8127)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:00,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8123 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8123))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8124)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8125)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8126)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8127)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:00,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8123 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int)) (v_ArrVal_8122 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8122))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8123)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8124)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8125)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8126)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8127)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:00,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8123 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int)) (v_ArrVal_8121 (Array Int Int)) (v_ArrVal_8122 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8121))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8122)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8123)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8124)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8125)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8126)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8127)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:02,716 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8125 (Array Int Int)) (v_ArrVal_8126 (Array Int Int)) (v_ArrVal_8123 (Array Int Int)) (v_ArrVal_8124 (Array Int Int)) (v_ArrVal_8129 (Array Int Int)) (v_ArrVal_8127 (Array Int Int)) (v_ArrVal_8128 (Array Int Int)) (v_ArrVal_8121 (Array Int Int)) (v_ArrVal_8122 (Array Int Int)) (v_ArrVal_8120 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8120))) (store .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8121)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8122)))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8123)))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8124)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8125)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8126)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8127)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8128)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_8129))) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~argv~0#1.offset|)) 0))) is different from false [2021-12-21 20:53:02,737 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 20:53:02,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53247 treesize of output 28684