./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c -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 eae29037f39f72e492ffc0d4d80667eddad5a4a3f1ba42f69f0f22dd69021a00 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:59:07,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:59:07,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:59:07,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:59:07,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:59:07,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:59:07,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:59:07,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:59:07,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:59:07,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:59:07,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:59:07,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:59:07,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:59:07,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:59:07,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:59:07,655 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:59:07,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:59:07,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:59:07,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:59:07,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:59:07,665 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:59:07,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:59:07,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:59:07,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:59:07,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:59:07,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:59:07,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:59:07,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:59:07,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:59:07,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:59:07,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:59:07,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:59:07,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:59:07,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:59:07,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:59:07,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:59:07,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:59:07,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:59:07,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:59:07,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:59:07,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:59:07,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:59:07,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-07-13 01:59:07,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:59:07,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:59:07,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:59:07,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:59:07,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:59:07,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:59:07,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:59:07,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:59:07,717 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:59:07,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:59:07,718 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:59:07,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:59:07,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:59:07,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 01:59:07,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:59:07,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 01:59:07,719 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 01:59:07,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 01:59:07,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:59:07,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 01:59:07,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:59:07,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:59:07,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:59:07,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:59:07,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:59:07,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:59:07,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 01:59:07,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:59:07,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:59:07,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 01:59:07,722 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 -> eae29037f39f72e492ffc0d4d80667eddad5a4a3f1ba42f69f0f22dd69021a00 [2022-07-13 01:59:07,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:59:07,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:59:07,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:59:07,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:59:07,980 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:59:07,981 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2022-07-13 01:59:08,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7925249/fca5080cf26f4ba1a5b22260a65f9480/FLAG41fafcafe [2022-07-13 01:59:08,382 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:59:08,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2022-07-13 01:59:08,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7925249/fca5080cf26f4ba1a5b22260a65f9480/FLAG41fafcafe [2022-07-13 01:59:08,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7925249/fca5080cf26f4ba1a5b22260a65f9480 [2022-07-13 01:59:08,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:59:08,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:59:08,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:59:08,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:59:08,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:59:08,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f5c61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08, skipping insertion in model container [2022-07-13 01:59:08,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:59:08,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:59:08,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:59:08,623 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:59:08,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:59:08,654 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:59:08,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08 WrapperNode [2022-07-13 01:59:08,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:59:08,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:59:08,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:59:08,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:59:08,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,698 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2022-07-13 01:59:08,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:59:08,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:59:08,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:59:08,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:59:08,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:59:08,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:59:08,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:59:08,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:59:08,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (1/1) ... [2022-07-13 01:59:08,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:59:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:59:08,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 01:59:08,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 01:59:08,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:59:08,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:59:08,852 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:59:08,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:59:09,068 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:59:09,075 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:59:09,075 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 01:59:09,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:59:09 BoogieIcfgContainer [2022-07-13 01:59:09,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:59:09,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:59:09,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:59:09,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:59:09,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:59:08" (1/3) ... [2022-07-13 01:59:09,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f54a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:59:09, skipping insertion in model container [2022-07-13 01:59:09,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:59:08" (2/3) ... [2022-07-13 01:59:09,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f54a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:59:09, skipping insertion in model container [2022-07-13 01:59:09,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:59:09" (3/3) ... [2022-07-13 01:59:09,094 INFO L111 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-1.c [2022-07-13 01:59:09,128 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:59:09,128 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-07-13 01:59:09,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:59:09,194 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a0fbbfb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68e5b8ab [2022-07-13 01:59:09,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-07-13 01:59:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:59:09,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:09,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:59:09,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:09,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:09,216 INFO L85 PathProgramCache]: Analyzing trace with hash 28694083, now seen corresponding path program 1 times [2022-07-13 01:59:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:09,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547449207] [2022-07-13 01:59:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:09,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:09,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547449207] [2022-07-13 01:59:09,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547449207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:09,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:09,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:59:09,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496786642] [2022-07-13 01:59:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:09,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:59:09,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:09,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:59:09,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:59:09,390 INFO L87 Difference]: Start difference. First operand has 88 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 87 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:09,577 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-07-13 01:59:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:59:09,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-13 01:59:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:09,585 INFO L225 Difference]: With dead ends: 182 [2022-07-13 01:59:09,586 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 01:59:09,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:59:09,591 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:09,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 55 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:59:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 01:59:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2022-07-13 01:59:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2022-07-13 01:59:09,630 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 5 [2022-07-13 01:59:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:09,631 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2022-07-13 01:59:09,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-07-13 01:59:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:59:09,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:09,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:59:09,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 01:59:09,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash 28693891, now seen corresponding path program 1 times [2022-07-13 01:59:09,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:09,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711159635] [2022-07-13 01:59:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:09,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:09,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711159635] [2022-07-13 01:59:09,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711159635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:09,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:09,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:59:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734621005] [2022-07-13 01:59:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:09,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:59:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:09,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:59:09,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:59:09,657 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:09,787 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-07-13 01:59:09,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:59:09,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-13 01:59:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:09,788 INFO L225 Difference]: With dead ends: 114 [2022-07-13 01:59:09,788 INFO L226 Difference]: Without dead ends: 98 [2022-07-13 01:59:09,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:59:09,790 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 48 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:09,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 44 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:09,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-13 01:59:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2022-07-13 01:59:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 81 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2022-07-13 01:59:09,797 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 5 [2022-07-13 01:59:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:09,798 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2022-07-13 01:59:09,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-07-13 01:59:09,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 01:59:09,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:09,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 01:59:09,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 01:59:09,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash 889576206, now seen corresponding path program 1 times [2022-07-13 01:59:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:09,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140444632] [2022-07-13 01:59:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140444632] [2022-07-13 01:59:09,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140444632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:09,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:09,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:59:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783725341] [2022-07-13 01:59:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:09,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:59:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:59:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:59:09,820 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:09,910 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-07-13 01:59:09,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:59:09,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-13 01:59:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:09,915 INFO L225 Difference]: With dead ends: 91 [2022-07-13 01:59:09,915 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 01:59:09,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:59:09,922 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:09,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 35 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 01:59:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2022-07-13 01:59:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-07-13 01:59:09,927 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 6 [2022-07-13 01:59:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:09,927 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-07-13 01:59:09,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-07-13 01:59:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 01:59:09,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:09,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:09,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 01:59:09,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash 121259884, now seen corresponding path program 1 times [2022-07-13 01:59:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:09,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272949677] [2022-07-13 01:59:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:09,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:09,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272949677] [2022-07-13 01:59:09,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272949677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:09,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:09,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:59:09,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011441963] [2022-07-13 01:59:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:09,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:59:09,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:59:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:59:09,970 INFO L87 Difference]: Start difference. First operand 81 states and 90 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) [2022-07-13 01:59:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:10,181 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-07-13 01:59:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:59:10,181 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 [2022-07-13 01:59:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:10,182 INFO L225 Difference]: With dead ends: 130 [2022-07-13 01:59:10,182 INFO L226 Difference]: Without dead ends: 123 [2022-07-13 01:59:10,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:59:10,184 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 70 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:10,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 43 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:59:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-13 01:59:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2022-07-13 01:59:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.325) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-07-13 01:59:10,190 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 8 [2022-07-13 01:59:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:10,191 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-07-13 01:59:10,191 INFO L496 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) [2022-07-13 01:59:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-07-13 01:59:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 01:59:10,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:10,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:10,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 01:59:10,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:10,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1416597265, now seen corresponding path program 1 times [2022-07-13 01:59:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:10,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626338394] [2022-07-13 01:59:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:10,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:10,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626338394] [2022-07-13 01:59:10,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626338394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:10,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:10,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:59:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974830704] [2022-07-13 01:59:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:10,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:59:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:10,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:59:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:59:10,219 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:10,301 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-07-13 01:59:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:59:10,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-13 01:59:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:10,302 INFO L225 Difference]: With dead ends: 106 [2022-07-13 01:59:10,303 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 01:59:10,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:59:10,304 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:10,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 31 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 01:59:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-07-13 01:59:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3125) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-07-13 01:59:10,310 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 9 [2022-07-13 01:59:10,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:10,311 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-07-13 01:59:10,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-07-13 01:59:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 01:59:10,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:10,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:10,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 01:59:10,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash 385767217, now seen corresponding path program 1 times [2022-07-13 01:59:10,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:10,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443199999] [2022-07-13 01:59:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:10,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:10,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443199999] [2022-07-13 01:59:10,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443199999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:10,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:10,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:59:10,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541906408] [2022-07-13 01:59:10,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:10,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:59:10,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:10,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:59:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:59:10,346 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:10,511 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2022-07-13 01:59:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:59:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 01:59:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:10,513 INFO L225 Difference]: With dead ends: 151 [2022-07-13 01:59:10,513 INFO L226 Difference]: Without dead ends: 145 [2022-07-13 01:59:10,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:59:10,514 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 123 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:10,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 40 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:59:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-13 01:59:10,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2022-07-13 01:59:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 105 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2022-07-13 01:59:10,522 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 11 [2022-07-13 01:59:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:10,523 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2022-07-13 01:59:10,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-07-13 01:59:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 01:59:10,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:10,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:10,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 01:59:10,524 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:10,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash -499454340, now seen corresponding path program 1 times [2022-07-13 01:59:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:10,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197097597] [2022-07-13 01:59:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:10,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197097597] [2022-07-13 01:59:10,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197097597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:10,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:10,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:59:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142808348] [2022-07-13 01:59:10,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:10,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:59:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:59:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:59:10,557 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:10,641 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-07-13 01:59:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:59:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-13 01:59:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:10,642 INFO L225 Difference]: With dead ends: 115 [2022-07-13 01:59:10,642 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 01:59:10,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:59:10,643 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:10,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 01:59:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2022-07-13 01:59:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2022-07-13 01:59:10,648 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 12 [2022-07-13 01:59:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:10,649 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2022-07-13 01:59:10,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2022-07-13 01:59:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 01:59:10,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:10,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:10,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 01:59:10,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash -941249638, now seen corresponding path program 1 times [2022-07-13 01:59:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:10,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764874498] [2022-07-13 01:59:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:10,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:10,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764874498] [2022-07-13 01:59:10,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764874498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:10,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:10,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:59:10,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280516058] [2022-07-13 01:59:10,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:10,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:59:10,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:10,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:59:10,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:59:10,688 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:10,888 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2022-07-13 01:59:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:59:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-13 01:59:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:10,889 INFO L225 Difference]: With dead ends: 169 [2022-07-13 01:59:10,890 INFO L226 Difference]: Without dead ends: 164 [2022-07-13 01:59:10,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:59:10,891 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 108 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:10,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 44 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:59:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-13 01:59:10,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 109. [2022-07-13 01:59:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 108 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-07-13 01:59:10,895 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 14 [2022-07-13 01:59:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:10,895 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-07-13 01:59:10,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-07-13 01:59:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 01:59:10,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:10,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:10,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 01:59:10,897 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1477441153, now seen corresponding path program 1 times [2022-07-13 01:59:10,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:10,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145757317] [2022-07-13 01:59:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:10,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:10,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:10,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145757317] [2022-07-13 01:59:10,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145757317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:10,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:10,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:59:10,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395493909] [2022-07-13 01:59:10,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:10,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:59:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:10,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:59:10,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:59:10,946 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:11,023 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-07-13 01:59:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:59:11,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-13 01:59:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:11,025 INFO L225 Difference]: With dead ends: 118 [2022-07-13 01:59:11,025 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 01:59:11,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:59:11,026 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:11,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 01:59:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2022-07-13 01:59:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.21875) internal successors, (117), 107 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2022-07-13 01:59:11,030 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 15 [2022-07-13 01:59:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:11,030 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2022-07-13 01:59:11,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-07-13 01:59:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 01:59:11,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:11,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:11,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 01:59:11,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1073596639, now seen corresponding path program 1 times [2022-07-13 01:59:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:11,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566325799] [2022-07-13 01:59:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:11,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:11,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566325799] [2022-07-13 01:59:11,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566325799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:11,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:11,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:59:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67002706] [2022-07-13 01:59:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:11,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 01:59:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 01:59:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:59:11,075 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:11,253 INFO L93 Difference]: Finished difference Result 184 states and 193 transitions. [2022-07-13 01:59:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:59:11,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-13 01:59:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:11,255 INFO L225 Difference]: With dead ends: 184 [2022-07-13 01:59:11,255 INFO L226 Difference]: Without dead ends: 180 [2022-07-13 01:59:11,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:59:11,256 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 179 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:11,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 37 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:59:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-13 01:59:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 106. [2022-07-13 01:59:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 105 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2022-07-13 01:59:11,260 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 17 [2022-07-13 01:59:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:11,260 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2022-07-13 01:59:11,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-07-13 01:59:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 01:59:11,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:11,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:11,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 01:59:11,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash 375562730, now seen corresponding path program 1 times [2022-07-13 01:59:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:11,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009858147] [2022-07-13 01:59:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:11,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009858147] [2022-07-13 01:59:11,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009858147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:11,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:11,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:59:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105763045] [2022-07-13 01:59:11,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:11,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 01:59:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 01:59:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:59:11,305 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:11,387 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-07-13 01:59:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:59:11,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 01:59:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:11,388 INFO L225 Difference]: With dead ends: 115 [2022-07-13 01:59:11,388 INFO L226 Difference]: Without dead ends: 114 [2022-07-13 01:59:11,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:59:11,389 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 106 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:11,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 19 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-13 01:59:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2022-07-13 01:59:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2022-07-13 01:59:11,392 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 18 [2022-07-13 01:59:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:11,393 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2022-07-13 01:59:11,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2022-07-13 01:59:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 01:59:11,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:11,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:11,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 01:59:11,395 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1103880248, now seen corresponding path program 1 times [2022-07-13 01:59:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:11,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759883009] [2022-07-13 01:59:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:11,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:11,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759883009] [2022-07-13 01:59:11,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759883009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:11,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:11,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 01:59:11,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311264501] [2022-07-13 01:59:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:11,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:59:11,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:11,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:59:11,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:59:11,442 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:11,650 INFO L93 Difference]: Finished difference Result 196 states and 205 transitions. [2022-07-13 01:59:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 01:59:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 01:59:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:11,652 INFO L225 Difference]: With dead ends: 196 [2022-07-13 01:59:11,652 INFO L226 Difference]: Without dead ends: 193 [2022-07-13 01:59:11,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:59:11,652 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 211 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:11,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 37 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:59:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-13 01:59:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 97. [2022-07-13 01:59:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-07-13 01:59:11,667 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 20 [2022-07-13 01:59:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:11,667 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-07-13 01:59:11,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-07-13 01:59:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 01:59:11,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:11,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:11,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 01:59:11,669 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -400403, now seen corresponding path program 1 times [2022-07-13 01:59:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:11,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346005741] [2022-07-13 01:59:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:11,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:11,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346005741] [2022-07-13 01:59:11,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346005741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:11,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:11,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 01:59:11,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481387191] [2022-07-13 01:59:11,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:11,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:59:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:11,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:59:11,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:59:11,734 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:11,833 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-07-13 01:59:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 01:59:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 01:59:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:11,835 INFO L225 Difference]: With dead ends: 106 [2022-07-13 01:59:11,835 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 01:59:11,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:59:11,836 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:11,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 19 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 01:59:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-07-13 01:59:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-07-13 01:59:11,840 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 21 [2022-07-13 01:59:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:11,840 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-07-13 01:59:11,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-07-13 01:59:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 01:59:11,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:11,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:11,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 01:59:11,846 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash 868231821, now seen corresponding path program 1 times [2022-07-13 01:59:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:11,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680477562] [2022-07-13 01:59:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:11,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:11,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680477562] [2022-07-13 01:59:11,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680477562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:11,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:11,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:59:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076606476] [2022-07-13 01:59:11,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:11,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:59:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:59:11,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:59:11,947 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:12,168 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2022-07-13 01:59:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:59:12,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-07-13 01:59:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:12,170 INFO L225 Difference]: With dead ends: 205 [2022-07-13 01:59:12,170 INFO L226 Difference]: Without dead ends: 203 [2022-07-13 01:59:12,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:59:12,172 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 221 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:12,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 38 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:59:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-13 01:59:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 82. [2022-07-13 01:59:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 81 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2022-07-13 01:59:12,176 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 23 [2022-07-13 01:59:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:12,176 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2022-07-13 01:59:12,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-07-13 01:59:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 01:59:12,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:12,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:12,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 01:59:12,181 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:12,182 INFO L85 PathProgramCache]: Analyzing trace with hash 956626264, now seen corresponding path program 1 times [2022-07-13 01:59:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:12,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824990867] [2022-07-13 01:59:12,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:12,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824990867] [2022-07-13 01:59:12,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824990867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:12,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:12,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:59:12,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084045750] [2022-07-13 01:59:12,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:12,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:59:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:12,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:59:12,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:59:12,250 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:12,346 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-07-13 01:59:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:59:12,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 01:59:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:12,347 INFO L225 Difference]: With dead ends: 91 [2022-07-13 01:59:12,347 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 01:59:12,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:59:12,350 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:12,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 15 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 01:59:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2022-07-13 01:59:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-07-13 01:59:12,353 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 24 [2022-07-13 01:59:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:12,353 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-07-13 01:59:12,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-07-13 01:59:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 01:59:12,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:12,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:12,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 01:59:12,356 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1201251318, now seen corresponding path program 1 times [2022-07-13 01:59:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:12,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394077405] [2022-07-13 01:59:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:12,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:12,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394077405] [2022-07-13 01:59:12,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394077405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:12,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:12,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 01:59:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157509972] [2022-07-13 01:59:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:12,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 01:59:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:12,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 01:59:12,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:59:12,437 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:12,680 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2022-07-13 01:59:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:59:12,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-13 01:59:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:12,681 INFO L225 Difference]: With dead ends: 211 [2022-07-13 01:59:12,682 INFO L226 Difference]: Without dead ends: 210 [2022-07-13 01:59:12,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:59:12,682 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 238 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:12,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 34 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:59:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-13 01:59:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 61. [2022-07-13 01:59:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.25) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-07-13 01:59:12,685 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 26 [2022-07-13 01:59:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:12,685 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-07-13 01:59:12,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-07-13 01:59:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:59:12,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:12,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:12,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 01:59:12,686 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1745165915, now seen corresponding path program 1 times [2022-07-13 01:59:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:12,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086717360] [2022-07-13 01:59:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:12,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:12,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086717360] [2022-07-13 01:59:12,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086717360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:12,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:12,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 01:59:12,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134933478] [2022-07-13 01:59:12,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:12,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 01:59:12,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:12,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 01:59:12,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:59:12,755 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:12,845 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-07-13 01:59:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:59:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 01:59:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:12,846 INFO L225 Difference]: With dead ends: 70 [2022-07-13 01:59:12,846 INFO L226 Difference]: Without dead ends: 69 [2022-07-13 01:59:12,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:59:12,847 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:12,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 9 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-13 01:59:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2022-07-13 01:59:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-07-13 01:59:12,849 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 27 [2022-07-13 01:59:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:12,849 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-07-13 01:59:12,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:12,850 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-07-13 01:59:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 01:59:12,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:12,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:12,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 01:59:12,851 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 810646747, now seen corresponding path program 1 times [2022-07-13 01:59:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:12,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776708377] [2022-07-13 01:59:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:12,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:12,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776708377] [2022-07-13 01:59:12,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776708377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:12,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:12,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 01:59:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618578579] [2022-07-13 01:59:12,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:12,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 01:59:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 01:59:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-07-13 01:59:12,926 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:13,279 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2022-07-13 01:59:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 01:59:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 01:59:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:13,281 INFO L225 Difference]: With dead ends: 201 [2022-07-13 01:59:13,281 INFO L226 Difference]: Without dead ends: 200 [2022-07-13 01:59:13,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-07-13 01:59:13,282 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 234 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:13,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 27 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:59:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-13 01:59:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 59. [2022-07-13 01:59:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-07-13 01:59:13,284 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 29 [2022-07-13 01:59:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:13,284 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-07-13 01:59:13,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-07-13 01:59:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 01:59:13,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:13,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:13,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 01:59:13,285 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash -639754457, now seen corresponding path program 1 times [2022-07-13 01:59:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:13,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822622262] [2022-07-13 01:59:13,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:13,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:59:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:59:13,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 01:59:13,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822622262] [2022-07-13 01:59:13,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822622262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:59:13,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:59:13,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:59:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288858638] [2022-07-13 01:59:13,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:59:13,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:59:13,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 01:59:13,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:59:13,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:59:13,314 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:59:13,403 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-07-13 01:59:13,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:59:13,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-13 01:59:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:59:13,404 INFO L225 Difference]: With dead ends: 77 [2022-07-13 01:59:13,405 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 01:59:13,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:59:13,405 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:59:13,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 34 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:59:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 01:59:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-07-13 01:59:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 61 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-07-13 01:59:13,407 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 30 [2022-07-13 01:59:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:59:13,408 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-07-13 01:59:13,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:59:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-07-13 01:59:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 01:59:13,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:59:13,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:13,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 01:59:13,408 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-07-13 01:59:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:59:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash -341187355, now seen corresponding path program 1 times [2022-07-13 01:59:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 01:59:13,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956319785] [2022-07-13 01:59:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:59:13,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 01:59:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 01:59:13,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 01:59:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 01:59:13,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 01:59:13,434 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 01:59:13,435 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 36 remaining) [2022-07-13 01:59:13,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 36 remaining) [2022-07-13 01:59:13,437 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 36 remaining) [2022-07-13 01:59:13,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 36 remaining) [2022-07-13 01:59:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 36 remaining) [2022-07-13 01:59:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 36 remaining) [2022-07-13 01:59:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 36 remaining) [2022-07-13 01:59:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 36 remaining) [2022-07-13 01:59:13,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 36 remaining) [2022-07-13 01:59:13,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 36 remaining) [2022-07-13 01:59:13,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 36 remaining) [2022-07-13 01:59:13,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 36 remaining) [2022-07-13 01:59:13,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 36 remaining) [2022-07-13 01:59:13,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 36 remaining) [2022-07-13 01:59:13,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 36 remaining) [2022-07-13 01:59:13,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 36 remaining) [2022-07-13 01:59:13,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 36 remaining) [2022-07-13 01:59:13,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 36 remaining) [2022-07-13 01:59:13,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 36 remaining) [2022-07-13 01:59:13,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 36 remaining) [2022-07-13 01:59:13,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 36 remaining) [2022-07-13 01:59:13,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 36 remaining) [2022-07-13 01:59:13,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 36 remaining) [2022-07-13 01:59:13,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 36 remaining) [2022-07-13 01:59:13,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 36 remaining) [2022-07-13 01:59:13,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 36 remaining) [2022-07-13 01:59:13,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 36 remaining) [2022-07-13 01:59:13,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 36 remaining) [2022-07-13 01:59:13,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 36 remaining) [2022-07-13 01:59:13,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 36 remaining) [2022-07-13 01:59:13,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 36 remaining) [2022-07-13 01:59:13,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 36 remaining) [2022-07-13 01:59:13,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 36 remaining) [2022-07-13 01:59:13,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 36 remaining) [2022-07-13 01:59:13,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 36 remaining) [2022-07-13 01:59:13,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 36 remaining) [2022-07-13 01:59:13,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 01:59:13,451 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:59:13,457 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 01:59:13,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 01:59:13 BoogieIcfgContainer [2022-07-13 01:59:13,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 01:59:13,480 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 01:59:13,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 01:59:13,480 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 01:59:13,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:59:09" (3/4) ... [2022-07-13 01:59:13,482 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 01:59:13,519 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 01:59:13,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 01:59:13,520 INFO L158 Benchmark]: Toolchain (without parser) took 5114.98ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 63.3MB in the beginning and 58.3MB in the end (delta: 5.1MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2022-07-13 01:59:13,520 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:59:13,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.01ms. Allocated memory is still 96.5MB. Free memory was 63.1MB in the beginning and 72.2MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 01:59:13,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.93ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 01:59:13,521 INFO L158 Benchmark]: Boogie Preprocessor took 31.98ms. Allocated memory is still 96.5MB. Free memory was 70.7MB in the beginning and 69.7MB in the end (delta: 964.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:59:13,521 INFO L158 Benchmark]: RCFGBuilder took 344.07ms. Allocated memory is still 96.5MB. Free memory was 69.7MB in the beginning and 57.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 01:59:13,521 INFO L158 Benchmark]: TraceAbstraction took 4401.26ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 56.6MB in the beginning and 60.4MB in the end (delta: -3.7MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2022-07-13 01:59:13,522 INFO L158 Benchmark]: Witness Printer took 39.36ms. Allocated memory is still 144.7MB. Free memory was 60.4MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 01:59:13,523 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.01ms. Allocated memory is still 96.5MB. Free memory was 63.1MB in the beginning and 72.2MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.93ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.98ms. Allocated memory is still 96.5MB. Free memory was 70.7MB in the beginning and 69.7MB in the end (delta: 964.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.07ms. Allocated memory is still 96.5MB. Free memory was 69.7MB in the beginning and 57.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4401.26ms. Allocated memory was 96.5MB in the beginning and 144.7MB in the end (delta: 48.2MB). Free memory was 56.6MB in the beginning and 60.4MB in the end (delta: -3.7MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Witness Printer took 39.36ms. Allocated memory is still 144.7MB. Free memory was 60.4MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 65]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 VAL [x=-1, y=-2147483648, z=0] [L24] COND FALSE !(x > 0) VAL [x=-1, y=-2147483648, z=0] [L27] EXPR x - 1 [L27] x = x - 1 VAL [x=-2, y=-2147483648, z=0] [L29] COND FALSE !(x > 0) VAL [x=-2, y=-2147483648, z=0] [L32] EXPR x - 1 [L32] x = x - 1 VAL [x=-3, y=-2147483648, z=0] [L34] COND FALSE !(x > 0) VAL [x=-3, y=-2147483648, z=0] [L37] EXPR x - 1 [L37] x = x - 1 VAL [x=-4, y=-2147483648, z=0] [L39] COND FALSE !(x > 0) VAL [x=-4, y=-2147483648, z=0] [L42] EXPR x - 1 [L42] x = x - 1 VAL [x=-5, y=-2147483648, z=0] [L44] COND FALSE !(x > 0) VAL [x=-5, y=-2147483648, z=0] [L47] EXPR x - 1 [L47] x = x - 1 VAL [x=-6, y=-2147483648, z=0] [L49] COND FALSE !(x > 0) VAL [x=-6, y=-2147483648, z=0] [L52] EXPR x - 1 [L52] x = x - 1 VAL [x=-7, y=-2147483648, z=0] [L54] COND FALSE !(x > 0) VAL [x=-7, y=-2147483648, z=0] [L57] EXPR x - 1 [L57] x = x - 1 VAL [x=-8, y=-2147483648, z=0] [L59] COND FALSE !(x > 0) VAL [x=-8, y=-2147483648, z=0] [L62] EXPR x - 1 [L62] x = x - 1 VAL [x=-9, y=-2147483648, z=0] [L64] COND TRUE y<100 && z<100 VAL [x=-9, y=-2147483648, z=0] [L65] y+x VAL [x=-9, y=-2147483648, z=0] - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2058 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2058 mSDsluCounter, 615 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 818 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4052 IncrementalHoareTripleChecker+Invalid, 4870 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 818 mSolverCounterUnsat, 483 mSDtfsCounter, 4052 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=8, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 812 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 01:59:13,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)