./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-lit/HarrisLalNoriRajamani-SAS2010-Fig2.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 676276db79a43f24ac4768848febffe3dd303b6e2c16071dede4e51ae957576d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:23,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:23,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:23,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:23,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:23,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:23,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:23,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:23,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:23,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:23,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:23,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:23,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:23,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:23,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:23,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:23,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:23,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:23,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:23,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:23,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:23,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:23,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:23,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:23,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:23,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:23,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:23,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:23,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:23,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:23,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:23,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:23,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:23,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:23,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:23,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:23,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:23,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:23,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:23,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:23,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:23,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:05:23,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:23,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:23,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:23,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:23,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:23,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:23,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:23,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:23,717 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:23,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:23,717 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:23,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:23,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:23,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:23,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:23,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:23,719 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:23,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:23,719 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:23,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:23,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:23,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:23,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:23,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:23,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:23,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:23,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:23,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:23,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:23,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:23,721 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 -> 676276db79a43f24ac4768848febffe3dd303b6e2c16071dede4e51ae957576d [2022-02-21 03:05:23,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:24,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:24,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:24,011 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:24,012 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:24,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2.c [2022-02-21 03:05:24,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f1caa2c0/bd7cac141d194f148585e8b1a5889773/FLAG456e853cf [2022-02-21 03:05:24,511 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:24,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig2.c [2022-02-21 03:05:24,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f1caa2c0/bd7cac141d194f148585e8b1a5889773/FLAG456e853cf [2022-02-21 03:05:24,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f1caa2c0/bd7cac141d194f148585e8b1a5889773 [2022-02-21 03:05:24,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:24,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:24,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:24,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:24,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:24,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:24" (1/1) ... [2022-02-21 03:05:24,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b9e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:24, skipping insertion in model container [2022-02-21 03:05:24,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:24" (1/1) ... [2022-02-21 03:05:24,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:24,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:25,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:25,132 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:25,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:25,170 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:25,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25 WrapperNode [2022-02-21 03:05:25,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:25,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:25,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:25,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:25,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,212 INFO L137 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2022-02-21 03:05:25,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:25,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:25,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:25,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:25,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:25,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:25,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:25,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:25,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:25,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:25,289 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-02-21 03:05:25,309 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-02-21 03:05:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2022-02-21 03:05:25,334 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2022-02-21 03:05:25,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:25,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:25,385 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:25,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:25,643 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:25,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:25,666 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:05:25,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:25 BoogieIcfgContainer [2022-02-21 03:05:25,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:25,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:25,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:25,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:25,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:24" (1/3) ... [2022-02-21 03:05:25,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a941f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:25, skipping insertion in model container [2022-02-21 03:05:25,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (2/3) ... [2022-02-21 03:05:25,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a941f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:25, skipping insertion in model container [2022-02-21 03:05:25,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:25" (3/3) ... [2022-02-21 03:05:25,674 INFO L111 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig2.c [2022-02-21 03:05:25,693 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:25,693 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:05:25,797 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:25,804 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:05:25,804 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:05:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 43 states have internal predecessors, (58), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:05:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:05:25,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:25,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:05:25,833 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:25,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2218532, now seen corresponding path program 1 times [2022-02-21 03:05:25,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:25,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931257986] [2022-02-21 03:05:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:26,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#true} assume { :begin_inline_ULTIMATE.init } true; {52#true} is VALID [2022-02-21 03:05:26,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~ret11#1, main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~ret15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~nondet18#1, main_~d~0#1, main_~x~0#1;main_~d~0#1 := 1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {54#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:26,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1; {54#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:26,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {54#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume !(main_~d~0#1 - 1 <= 2147483647); {53#false} is VALID [2022-02-21 03:05:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:26,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:26,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931257986] [2022-02-21 03:05:26,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931257986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:26,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:26,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:26,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215291535] [2022-02-21 03:05:26,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:26,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 03:05:26,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:26,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:26,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:26,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:26,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:26,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:26,067 INFO L87 Difference]: Start difference. First operand has 49 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 43 states have internal predecessors, (58), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,227 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-02-21 03:05:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:26,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 03:05:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-21 03:05:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-21 03:05:26,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-02-21 03:05:26,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:26,326 INFO L225 Difference]: With dead ends: 53 [2022-02-21 03:05:26,329 INFO L226 Difference]: Without dead ends: 43 [2022-02-21 03:05:26,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:26,334 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:26,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 75 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-21 03:05:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-21 03:05:26,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:26,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 34 states have (on average 1.5) internal successors, (51), 37 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:05:26,374 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 34 states have (on average 1.5) internal successors, (51), 37 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:05:26,375 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 34 states have (on average 1.5) internal successors, (51), 37 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:05:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,389 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-02-21 03:05:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2022-02-21 03:05:26,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 34 states have (on average 1.5) internal successors, (51), 37 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-21 03:05:26,394 INFO L87 Difference]: Start difference. First operand has 43 states, 34 states have (on average 1.5) internal successors, (51), 37 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 43 states. [2022-02-21 03:05:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,404 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-02-21 03:05:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2022-02-21 03:05:26,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:26,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.5) internal successors, (51), 37 states have internal predecessors, (51), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 03:05:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2022-02-21 03:05:26,411 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 4 [2022-02-21 03:05:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:26,412 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2022-02-21 03:05:26,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2022-02-21 03:05:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:26,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:26,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:26,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:26,415 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 68774573, now seen corresponding path program 1 times [2022-02-21 03:05:26,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:26,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237055917] [2022-02-21 03:05:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:26,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } true; {251#true} is VALID [2022-02-21 03:05:26,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~ret11#1, main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~ret15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~nondet18#1, main_~d~0#1, main_~x~0#1;main_~d~0#1 := 1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {253#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:26,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1; {253#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:26,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume main_~d~0#1 - 1 <= 2147483647; {253#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:26,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {253#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume !(main_~d~0#1 - 1 >= -2147483648); {252#false} is VALID [2022-02-21 03:05:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:26,457 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:26,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237055917] [2022-02-21 03:05:26,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237055917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:26,461 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:26,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:26,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766539852] [2022-02-21 03:05:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:26,463 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-02-21 03:05:26,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:26,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-21 03:05:26,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:26,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:26,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:26,477 INFO L87 Difference]: Start difference. First operand 43 states and 59 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-02-21 03:05:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,616 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2022-02-21 03:05:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:26,617 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-02-21 03:05:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-21 03:05:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-21 03:05:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-21 03:05:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-21 03:05:26,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2022-02-21 03:05:26,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:26,722 INFO L225 Difference]: With dead ends: 69 [2022-02-21 03:05:26,722 INFO L226 Difference]: Without dead ends: 67 [2022-02-21 03:05:26,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:26,729 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:26,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 103 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-21 03:05:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-02-21 03:05:26,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:26,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 62 states, 50 states have (on average 1.42) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:26,748 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 62 states, 50 states have (on average 1.42) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:26,748 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 62 states, 50 states have (on average 1.42) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,753 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-02-21 03:05:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-02-21 03:05:26,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 50 states have (on average 1.42) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 67 states. [2022-02-21 03:05:26,755 INFO L87 Difference]: Start difference. First operand has 62 states, 50 states have (on average 1.42) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 67 states. [2022-02-21 03:05:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,760 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-02-21 03:05:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-02-21 03:05:26,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:26,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.42) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2022-02-21 03:05:26,766 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 5 [2022-02-21 03:05:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:26,766 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2022-02-21 03:05:26,766 INFO L471 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-02-21 03:05:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2022-02-21 03:05:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:05:26,768 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:26,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:26,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:26,769 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1927016760, now seen corresponding path program 1 times [2022-02-21 03:05:26,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:26,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554845871] [2022-02-21 03:05:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:26,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {539#true} assume { :begin_inline_ULTIMATE.init } true; {539#true} is VALID [2022-02-21 03:05:26,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~ret11#1, main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~ret15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~nondet18#1, main_~d~0#1, main_~x~0#1;main_~d~0#1 := 1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,814 INFO L290 TraceCheckUtils]: 4: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet18#1);havoc main_#t~nondet18#1; {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !!(main_~x~0#1 > 0); {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:26,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {541#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(main_~x~0#1 - main_~d~0#1 <= 2147483647); {540#false} is VALID [2022-02-21 03:05:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:26,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:26,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554845871] [2022-02-21 03:05:26,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554845871] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:26,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:26,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:26,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464391275] [2022-02-21 03:05:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:26,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-21 03:05:26,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:26,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-21 03:05:26,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:26,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:26,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:26,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:26,845 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-21 03:05:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,964 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2022-02-21 03:05:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:26,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-21 03:05:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-21 03:05:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 03:05:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-21 03:05:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 03:05:26,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2022-02-21 03:05:27,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:27,065 INFO L225 Difference]: With dead ends: 66 [2022-02-21 03:05:27,065 INFO L226 Difference]: Without dead ends: 65 [2022-02-21 03:05:27,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:27,071 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:27,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 100 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-21 03:05:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-02-21 03:05:27,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:27,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 64 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 54 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,104 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 64 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 54 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,105 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 64 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 54 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,109 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-02-21 03:05:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2022-02-21 03:05:27,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:27,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:27,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 54 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-02-21 03:05:27,116 INFO L87 Difference]: Start difference. First operand has 64 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 54 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-02-21 03:05:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,119 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-02-21 03:05:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2022-02-21 03:05:27,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:27,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:27,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:27,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 54 states have internal predecessors, (73), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2022-02-21 03:05:27,124 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 15 [2022-02-21 03:05:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:27,124 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2022-02-21 03:05:27,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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-02-21 03:05:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2022-02-21 03:05:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:05:27,125 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:27,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:27,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:05:27,126 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash -392022441, now seen corresponding path program 1 times [2022-02-21 03:05:27,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:27,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074646926] [2022-02-21 03:05:27,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} assume { :begin_inline_ULTIMATE.init } true; {822#true} is VALID [2022-02-21 03:05:27,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~ret11#1, main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~ret15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~nondet18#1, main_~d~0#1, main_~x~0#1;main_~d~0#1 := 1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume !(0 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume !(0 != main_#t~nondet18#1);havoc main_#t~nondet18#1; {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} is VALID [2022-02-21 03:05:27,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {824#(<= |ULTIMATE.start_main_~d~0#1| 1)} assume !!(main_~x~0#1 > 0); {825#(<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:27,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {825#(<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - main_~d~0#1 <= 2147483647; {825#(<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:27,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {825#(<= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 - main_~d~0#1 >= -2147483648); {823#false} is VALID [2022-02-21 03:05:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:27,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:27,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074646926] [2022-02-21 03:05:27,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074646926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:27,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:27,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:27,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220926273] [2022-02-21 03:05:27,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:27,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 03:05:27,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:27,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-21 03:05:27,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:27,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:27,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:27,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:27,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:27,204 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-21 03:05:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,341 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2022-02-21 03:05:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:27,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 03:05:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-21 03:05:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-02-21 03:05:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-21 03:05:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-02-21 03:05:27,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-02-21 03:05:27,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:27,395 INFO L225 Difference]: With dead ends: 64 [2022-02-21 03:05:27,396 INFO L226 Difference]: Without dead ends: 63 [2022-02-21 03:05:27,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:05:27,401 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:27,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 114 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-21 03:05:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-21 03:05:27,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:27,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,427 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,427 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,432 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2022-02-21 03:05:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-02-21 03:05:27,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:27,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:27,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-02-21 03:05:27,434 INFO L87 Difference]: Start difference. First operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-02-21 03:05:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,440 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2022-02-21 03:05:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-02-21 03:05:27,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:27,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:27,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:27,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-02-21 03:05:27,446 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 16 [2022-02-21 03:05:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:27,446 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-02-21 03:05:27,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-02-21 03:05:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-02-21 03:05:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:05:27,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:27,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:27,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:05:27,448 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:27,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash 726265332, now seen corresponding path program 1 times [2022-02-21 03:05:27,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:27,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378928663] [2022-02-21 03:05:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {1101#true} assume { :begin_inline_ULTIMATE.init } true; {1101#true} is VALID [2022-02-21 03:05:27,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {1101#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~ret11#1, main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~ret15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~nondet18#1, main_~d~0#1, main_~x~0#1;main_~d~0#1 := 1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume !(0 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume 0 != main_#t~nondet18#1;havoc main_#t~nondet18#1; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume main_~d~0#1 - 1 <= 2147483647; {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} is VALID [2022-02-21 03:05:27,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {1103#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~d~0#1| 2147483646))} assume main_~d~0#1 - 1 >= -2147483648;main_~d~0#1 := main_~d~0#1 - 1; {1104#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:27,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {1104#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~d~0#1|))} assume !!(main_~x~0#1 > 0); {1104#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:27,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~d~0#1|))} assume !(main_~x~0#1 - main_~d~0#1 <= 2147483647); {1102#false} is VALID [2022-02-21 03:05:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:27,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:27,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378928663] [2022-02-21 03:05:27,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378928663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:27,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:27,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:27,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538191486] [2022-02-21 03:05:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:27,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:27,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:27,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:27,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:27,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:27,533 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,674 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2022-02-21 03:05:27,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:27,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-02-21 03:05:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-02-21 03:05:27,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2022-02-21 03:05:27,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:27,768 INFO L225 Difference]: With dead ends: 67 [2022-02-21 03:05:27,768 INFO L226 Difference]: Without dead ends: 66 [2022-02-21 03:05:27,768 INFO L932 BasicCegarLoop]: 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-02-21 03:05:27,769 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:27,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 117 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-21 03:05:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2022-02-21 03:05:27,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:27,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,799 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,799 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,802 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2022-02-21 03:05:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2022-02-21 03:05:27,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:27,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:27,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 66 states. [2022-02-21 03:05:27,809 INFO L87 Difference]: Start difference. First operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 66 states. [2022-02-21 03:05:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,812 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2022-02-21 03:05:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2022-02-21 03:05:27,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:27,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:27,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:27,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-02-21 03:05:27,815 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 17 [2022-02-21 03:05:27,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:27,816 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-02-21 03:05:27,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-02-21 03:05:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:05:27,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:27,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:27,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:05:27,831 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1536925138, now seen corresponding path program 1 times [2022-02-21 03:05:27,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:27,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796299636] [2022-02-21 03:05:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {1387#true} assume { :begin_inline_ULTIMATE.init } true; {1387#true} is VALID [2022-02-21 03:05:27,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {1387#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~ret11#1, main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~ret15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~nondet18#1, main_~d~0#1, main_~x~0#1;main_~d~0#1 := 1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {1389#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {1389#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume 0 != main_#t~nondet9#1;havoc main_#t~nondet9#1; {1389#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {1389#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume main_~d~0#1 - 1 <= 2147483647; {1389#(<= 1 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {1389#(<= 1 |ULTIMATE.start_main_~d~0#1|)} assume main_~d~0#1 - 1 >= -2147483648;main_~d~0#1 := main_~d~0#1 - 1; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume !(0 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume 0 != main_#t~nondet18#1;havoc main_#t~nondet18#1; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume main_~d~0#1 - 1 <= 2147483647; {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} is VALID [2022-02-21 03:05:27,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#(<= 0 |ULTIMATE.start_main_~d~0#1|)} assume !(main_~d~0#1 - 1 >= -2147483648); {1388#false} is VALID [2022-02-21 03:05:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:27,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:27,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796299636] [2022-02-21 03:05:27,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796299636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:27,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:27,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:27,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895578581] [2022-02-21 03:05:27,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:27,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:27,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:27,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:27,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:27,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:27,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:27,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:27,917 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,033 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-02-21 03:05:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:28,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-02-21 03:05:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-02-21 03:05:28,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-02-21 03:05:28,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:28,113 INFO L225 Difference]: With dead ends: 73 [2022-02-21 03:05:28,113 INFO L226 Difference]: Without dead ends: 72 [2022-02-21 03:05:28,114 INFO L932 BasicCegarLoop]: 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-02-21 03:05:28,115 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 40 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:28,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 119 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-21 03:05:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2022-02-21 03:05:28,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:28,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 62 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:28,142 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 62 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:28,142 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 62 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,145 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-02-21 03:05:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-02-21 03:05:28,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:28,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:28,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 72 states. [2022-02-21 03:05:28,149 INFO L87 Difference]: Start difference. First operand has 62 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 72 states. [2022-02-21 03:05:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,151 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-02-21 03:05:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-02-21 03:05:28,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:28,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:28,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:28,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2022-02-21 03:05:28,158 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 87 transitions. Word has length 17 [2022-02-21 03:05:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:28,159 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 87 transitions. [2022-02-21 03:05:28,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-02-21 03:05:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2022-02-21 03:05:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:05:28,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:28,160 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:28,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:05:28,161 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1223560697, now seen corresponding path program 1 times [2022-02-21 03:05:28,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:28,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690381524] [2022-02-21 03:05:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:28,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {1690#true} assume { :begin_inline_ULTIMATE.init } true; {1690#true} is VALID [2022-02-21 03:05:28,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~ret11#1, main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~ret15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~nondet18#1, main_~d~0#1, main_~x~0#1;main_~d~0#1 := 1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume !(0 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume !(0 != main_#t~nondet18#1);havoc main_#t~nondet18#1; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume !!(main_~x~0#1 > 0); {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume main_~x~0#1 - main_~d~0#1 <= 2147483647; {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} is VALID [2022-02-21 03:05:28,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {1692#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~d~0#1|)))} assume main_~x~0#1 - main_~d~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~d~0#1; {1693#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {1693#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 |ULTIMATE.start_main_~d~0#1|))} assume !!(main_~x~0#1 > 0); {1693#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {1693#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 |ULTIMATE.start_main_~d~0#1|))} assume !(main_~x~0#1 - main_~d~0#1 <= 2147483647); {1691#false} is VALID [2022-02-21 03:05:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:28,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:28,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690381524] [2022-02-21 03:05:28,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690381524] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:28,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778864087] [2022-02-21 03:05:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:28,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:28,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:28,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:05:28,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:05:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:28,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:05:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:28,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:28,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {1690#true} assume { :begin_inline_ULTIMATE.init } true; {1690#true} is VALID [2022-02-21 03:05:28,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~ret11#1, main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~ret15#1, main_#t~nondet16#1, main_#t~ret17#1, main_#t~nondet18#1, main_~d~0#1, main_~x~0#1;main_~d~0#1 := 1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~x~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !(0 != main_#t~nondet14#1);havoc main_#t~nondet14#1; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !(0 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !(0 != main_#t~nondet18#1);havoc main_#t~nondet18#1; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !!(main_~x~0#1 > 0); {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume main_~x~0#1 - main_~d~0#1 <= 2147483647; {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1700#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume main_~x~0#1 - main_~d~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~d~0#1; {1743#(and (<= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {1743#(and (<= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !!(main_~x~0#1 > 0); {1743#(and (<= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-21 03:05:28,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {1743#(and (<= (+ |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~x~0#1|) 2147483647) (<= 1 |ULTIMATE.start_main_~d~0#1|))} assume !(main_~x~0#1 - main_~d~0#1 <= 2147483647); {1691#false} is VALID [2022-02-21 03:05:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:28,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:05:28,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778864087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:28,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:05:28,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-02-21 03:05:28,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397022392] [2022-02-21 03:05:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:28,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-21 03:05:28,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:28,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-21 03:05:28,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:28,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:28,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:28,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:05:28,614 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-21 03:05:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,748 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2022-02-21 03:05:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:05:28,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-21 03:05:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-21 03:05:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-02-21 03:05:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-21 03:05:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-02-21 03:05:28,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2022-02-21 03:05:28,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:28,819 INFO L225 Difference]: With dead ends: 69 [2022-02-21 03:05:28,820 INFO L226 Difference]: Without dead ends: 62 [2022-02-21 03:05:28,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:05:28,821 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:28,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 149 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-21 03:05:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-21 03:05:28,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:28,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:28,841 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:28,842 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,844 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2022-02-21 03:05:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-02-21 03:05:28,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:28,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:28,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 62 states. [2022-02-21 03:05:28,845 INFO L87 Difference]: Start difference. First operand has 62 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 62 states. [2022-02-21 03:05:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,847 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2022-02-21 03:05:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-02-21 03:05:28,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:28,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:28,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:28,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:05:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2022-02-21 03:05:28,850 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 18 [2022-02-21 03:05:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:28,851 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2022-02-21 03:05:28,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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-02-21 03:05:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-02-21 03:05:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:05:28,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:28,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:28,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:05:29,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:29,068 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:29,069 INFO L85 PathProgramCache]: Analyzing trace with hash 483696656, now seen corresponding path program 1 times [2022-02-21 03:05:29,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:29,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407919704] [2022-02-21 03:05:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:29,088 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:05:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:05:29,105 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:05:29,105 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:05:29,106 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-02-21 03:05:29,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-02-21 03:05:29,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-02-21 03:05:29,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-02-21 03:05:29,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-02-21 03:05:29,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-02-21 03:05:29,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 03:05:29,111 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:29,114 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:05:29,127 WARN L170 areAnnotationChecker]: fooENTRY has no Hoare annotation [2022-02-21 03:05:29,127 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:05:29,127 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-21 03:05:29,128 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: fooFINAL has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-21 03:05:29,129 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: fooEXIT has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-21 03:05:29,130 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L67-2 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-21 03:05:29,131 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2022-02-21 03:05:29,132 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:29,132 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:05:29,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:05:29 BoogieIcfgContainer [2022-02-21 03:05:29,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:05:29,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:05:29,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:05:29,134 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:05:29,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:25" (3/4) ... [2022-02-21 03:05:29,135 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:05:29,159 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:05:29,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:05:29,160 INFO L158 Benchmark]: Toolchain (without parser) took 4231.60ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 69.3MB in the beginning and 57.0MB in the end (delta: 12.3MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-02-21 03:05:29,160 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 77.6MB. Free memory was 43.1MB in the beginning and 43.1MB in the end (delta: 44.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:29,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.30ms. Allocated memory is still 98.6MB. Free memory was 69.1MB in the beginning and 59.6MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:05:29,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.79ms. Allocated memory is still 98.6MB. Free memory was 59.6MB in the beginning and 58.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:29,161 INFO L158 Benchmark]: Boogie Preprocessor took 41.22ms. Allocated memory is still 98.6MB. Free memory was 58.0MB in the beginning and 56.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:29,161 INFO L158 Benchmark]: RCFGBuilder took 412.42ms. Allocated memory is still 98.6MB. Free memory was 56.9MB in the beginning and 42.2MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:05:29,162 INFO L158 Benchmark]: TraceAbstraction took 3464.53ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 41.7MB in the beginning and 58.1MB in the end (delta: -16.4MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-02-21 03:05:29,162 INFO L158 Benchmark]: Witness Printer took 25.91ms. Allocated memory is still 119.5MB. Free memory was 58.1MB in the beginning and 57.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:29,163 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 77.6MB. Free memory was 43.1MB in the beginning and 43.1MB in the end (delta: 44.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.30ms. Allocated memory is still 98.6MB. Free memory was 69.1MB in the beginning and 59.6MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.79ms. Allocated memory is still 98.6MB. Free memory was 59.6MB in the beginning and 58.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.22ms. Allocated memory is still 98.6MB. Free memory was 58.0MB in the beginning and 56.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.42ms. Allocated memory is still 98.6MB. Free memory was 56.9MB in the beginning and 42.2MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3464.53ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 41.7MB in the beginning and 58.1MB in the end (delta: -16.4MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 25.91ms. Allocated memory is still 119.5MB. Free memory was 58.1MB in the beginning and 57.0MB in the end (delta: 1.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: 81]: integer overflow possible integer overflow possible We found a FailurePath: [L53] int d = 1; [L54] int x = __VERIFIER_nondet_int(); [L56] COND TRUE __VERIFIER_nondet_int() [L57] EXPR d - 1 [L57] d = d - 1 VAL [d=0, x=2147483647] [L61] COND FALSE !(__VERIFIER_nondet_int()) [L64] COND FALSE !(__VERIFIER_nondet_int()) [L67] COND FALSE !(__VERIFIER_nondet_int()) [L70] COND FALSE !(__VERIFIER_nondet_int()) [L76] COND TRUE __VERIFIER_nondet_int() [L77] EXPR d - 1 [L77] d = d - 1 VAL [d=-1, x=2147483647] [L80] COND TRUE x > 0 VAL [d=-1, x=2147483647] [L81] x - d VAL [d=-1, x=2147483647] - 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: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: 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 2 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 777 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 400 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 377 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 474 SizeOfPredicates, 0 NumberOfNonLiveVariables, 38 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2/4 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-02-21 03:05:29,192 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)