./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-Fig1.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 c0bce2603970e0a002a5b33cfd00ef3446011286 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:23:38,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:23:38,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:23:38,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:23:38,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:23:38,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:23:38,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:23:38,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:23:38,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:23:38,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:23:38,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:23:38,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:23:38,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:23:38,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:23:38,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:23:38,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:23:38,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:23:38,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:23:38,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:23:38,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:23:38,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:23:38,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:23:38,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:23:38,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:23:38,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:23:38,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:23:38,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:23:38,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:23:38,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:23:38,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:23:38,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:23:38,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:23:38,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:23:38,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:23:38,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:23:38,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:23:38,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:23:38,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:23:38,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:23:38,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:23:38,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:23:38,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2020-07-29 01:23:38,164 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:23:38,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:23:38,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:23:38,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:23:38,166 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:23:38,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:23:38,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:23:38,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:23:38,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:23:38,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-29 01:23:38,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:23:38,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-29 01:23:38,168 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2020-07-29 01:23:38,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:23:38,168 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:23:38,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-29 01:23:38,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:23:38,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:23:38,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:23:38,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:23:38,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:23:38,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:23:38,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:23:38,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-29 01:23:38,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:23:38,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:23:38,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-29 01:23:38,171 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:23:38,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> c0bce2603970e0a002a5b33cfd00ef3446011286 [2020-07-29 01:23:38,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:23:38,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:23:38,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:23:38,494 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:23:38,495 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:23:38,495 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c [2020-07-29 01:23:38,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63e018d8/3158f7dc0dd244efba0c89aede1aafbf/FLAG1205406ca [2020-07-29 01:23:39,033 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:23:39,036 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c [2020-07-29 01:23:39,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63e018d8/3158f7dc0dd244efba0c89aede1aafbf/FLAG1205406ca [2020-07-29 01:23:39,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63e018d8/3158f7dc0dd244efba0c89aede1aafbf [2020-07-29 01:23:39,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:23:39,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:23:39,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:23:39,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:23:39,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:23:39,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@80cfe2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39, skipping insertion in model container [2020-07-29 01:23:39,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:23:39,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:23:39,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:23:39,614 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:23:39,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:23:39,646 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:23:39,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39 WrapperNode [2020-07-29 01:23:39,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:23:39,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:23:39,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:23:39,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:23:39,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:23:39,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:23:39,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:23:39,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:23:39,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... [2020-07-29 01:23:39,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:23:39,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:23:39,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:23:39,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:23:39,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:23:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:23:39,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:23:40,479 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:23:40,479 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-29 01:23:40,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:23:40 BoogieIcfgContainer [2020-07-29 01:23:40,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:23:40,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:23:40,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:23:40,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:23:40,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:23:39" (1/3) ... [2020-07-29 01:23:40,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2741f2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:23:40, skipping insertion in model container [2020-07-29 01:23:40,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:23:39" (2/3) ... [2020-07-29 01:23:40,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2741f2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:23:40, skipping insertion in model container [2020-07-29 01:23:40,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:23:40" (3/3) ... [2020-07-29 01:23:40,493 INFO L109 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig1.c [2020-07-29 01:23:40,504 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:23:40,513 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-29 01:23:40,531 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-29 01:23:40,568 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:23:40,568 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-29 01:23:40,568 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:23:40,569 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:23:40,569 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:23:40,569 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:23:40,570 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:23:40,570 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:23:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-29 01:23:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-29 01:23:40,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:40,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-29 01:23:40,604 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:40,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash 29681062, now seen corresponding path program 1 times [2020-07-29 01:23:40,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:40,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501041679] [2020-07-29 01:23:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:40,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#true} havoc main_#res;havoc main_#t~nondet5;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {48#true} is VALID [2020-07-29 01:23:40,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#true} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;assume -2147483648 <= f_#t~nondet0 && f_#t~nondet0 <= 2147483647;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;assume -2147483648 <= f_#t~nondet1 && f_#t~nondet1 <= 2147483647;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;assume -2147483648 <= f_#t~nondet2 && f_#t~nondet2 <= 2147483647;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {50#(<= ULTIMATE.start_f_~z~0 1)} is VALID [2020-07-29 01:23:40,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#(<= ULTIMATE.start_f_~z~0 1)} assume !(f_~k~0 > 1073741823); {50#(<= ULTIMATE.start_f_~z~0 1)} is VALID [2020-07-29 01:23:40,811 INFO L280 TraceCheckUtils]: 3: Hoare triple {50#(<= ULTIMATE.start_f_~z~0 1)} assume !!(f_~z~0 < f_~k~0); {50#(<= ULTIMATE.start_f_~z~0 1)} is VALID [2020-07-29 01:23:40,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {50#(<= ULTIMATE.start_f_~z~0 1)} assume !(2 * f_~z~0 <= 2147483647); {49#false} is VALID [2020-07-29 01:23:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:40,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501041679] [2020-07-29 01:23:40,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:40,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:40,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287052681] [2020-07-29 01:23:40,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-29 01:23:40,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:40,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:40,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:40,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:40,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:40,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:40,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:40,859 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2020-07-29 01:23:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:41,122 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2020-07-29 01:23:41,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:41,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-29 01:23:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-29 01:23:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-29 01:23:41,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2020-07-29 01:23:41,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:41,358 INFO L225 Difference]: With dead ends: 111 [2020-07-29 01:23:41,359 INFO L226 Difference]: Without dead ends: 72 [2020-07-29 01:23:41,363 INFO L675 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 [2020-07-29 01:23:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-29 01:23:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2020-07-29 01:23:41,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:41,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 62 states. [2020-07-29 01:23:41,405 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 62 states. [2020-07-29 01:23:41,405 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 62 states. [2020-07-29 01:23:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:41,411 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2020-07-29 01:23:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2020-07-29 01:23:41,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:41,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:41,413 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 72 states. [2020-07-29 01:23:41,414 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 72 states. [2020-07-29 01:23:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:41,419 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2020-07-29 01:23:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2020-07-29 01:23:41,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:41,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:41,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:41,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-29 01:23:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2020-07-29 01:23:41,427 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 5 [2020-07-29 01:23:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:41,428 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2020-07-29 01:23:41,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2020-07-29 01:23:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-29 01:23:41,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:41,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:23:41,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:23:41,431 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:41,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:41,432 INFO L82 PathProgramCache]: Analyzing trace with hash 920112974, now seen corresponding path program 1 times [2020-07-29 01:23:41,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:41,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286503845] [2020-07-29 01:23:41,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:41,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {373#true} havoc main_#res;havoc main_#t~nondet5;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {373#true} is VALID [2020-07-29 01:23:41,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {373#true} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;assume -2147483648 <= f_#t~nondet0 && f_#t~nondet0 <= 2147483647;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;assume -2147483648 <= f_#t~nondet1 && f_#t~nondet1 <= 2147483647;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;assume -2147483648 <= f_#t~nondet2 && f_#t~nondet2 <= 2147483647;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {375#(<= 1 ULTIMATE.start_f_~z~0)} is VALID [2020-07-29 01:23:41,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#(<= 1 ULTIMATE.start_f_~z~0)} assume !(f_~k~0 > 1073741823); {375#(<= 1 ULTIMATE.start_f_~z~0)} is VALID [2020-07-29 01:23:41,476 INFO L280 TraceCheckUtils]: 3: Hoare triple {375#(<= 1 ULTIMATE.start_f_~z~0)} assume !!(f_~z~0 < f_~k~0); {375#(<= 1 ULTIMATE.start_f_~z~0)} is VALID [2020-07-29 01:23:41,477 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#(<= 1 ULTIMATE.start_f_~z~0)} assume 2 * f_~z~0 <= 2147483647; {375#(<= 1 ULTIMATE.start_f_~z~0)} is VALID [2020-07-29 01:23:41,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {375#(<= 1 ULTIMATE.start_f_~z~0)} assume !(2 * f_~z~0 >= -2147483648); {374#false} is VALID [2020-07-29 01:23:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:41,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286503845] [2020-07-29 01:23:41,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:41,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:41,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590442494] [2020-07-29 01:23:41,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-29 01:23:41,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:41,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:41,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:41,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:41,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:41,494 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand 3 states. [2020-07-29 01:23:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:41,631 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2020-07-29 01:23:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:41,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-29 01:23:41,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-29 01:23:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-29 01:23:41,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-29 01:23:41,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:41,745 INFO L225 Difference]: With dead ends: 104 [2020-07-29 01:23:41,745 INFO L226 Difference]: Without dead ends: 100 [2020-07-29 01:23:41,746 INFO L675 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 [2020-07-29 01:23:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-29 01:23:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2020-07-29 01:23:41,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:41,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 92 states. [2020-07-29 01:23:41,757 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 92 states. [2020-07-29 01:23:41,758 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 92 states. [2020-07-29 01:23:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:41,764 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2020-07-29 01:23:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2020-07-29 01:23:41,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:41,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:41,766 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 100 states. [2020-07-29 01:23:41,766 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 100 states. [2020-07-29 01:23:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:41,772 INFO L93 Difference]: Finished difference Result 100 states and 133 transitions. [2020-07-29 01:23:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2020-07-29 01:23:41,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:41,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:41,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:41,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-29 01:23:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2020-07-29 01:23:41,780 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 6 [2020-07-29 01:23:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:41,780 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2020-07-29 01:23:41,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2020-07-29 01:23:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:23:41,782 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:41,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:41,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:23:41,783 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:41,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1541315464, now seen corresponding path program 1 times [2020-07-29 01:23:41,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:41,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043451504] [2020-07-29 01:23:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:41,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {774#true} havoc main_#res;havoc main_#t~nondet5;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {774#true} is VALID [2020-07-29 01:23:41,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;assume -2147483648 <= f_#t~nondet0 && f_#t~nondet0 <= 2147483647;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;assume -2147483648 <= f_#t~nondet1 && f_#t~nondet1 <= 2147483647;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;assume -2147483648 <= f_#t~nondet2 && f_#t~nondet2 <= 2147483647;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:41,845 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} assume !(f_~k~0 > 1073741823); {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:41,846 INFO L280 TraceCheckUtils]: 3: Hoare triple {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} assume !(f_~z~0 < f_~k~0); {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:41,847 INFO L280 TraceCheckUtils]: 4: Hoare triple {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} assume !!(f_~x~0 > 0 && f_~y~0 > 0);assume -2147483648 <= f_#t~nondet3 && f_#t~nondet3 <= 2147483647; {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:41,848 INFO L280 TraceCheckUtils]: 5: Hoare triple {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:41,849 INFO L280 TraceCheckUtils]: 6: Hoare triple {776#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 1 ULTIMATE.start_f_~d))} assume !(f_~x~0 - f_~d <= 2147483647); {775#false} is VALID [2020-07-29 01:23:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:41,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043451504] [2020-07-29 01:23:41,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:41,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:41,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573707079] [2020-07-29 01:23:41,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:41,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:41,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:41,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:41,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:41,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:41,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:41,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:41,864 INFO L87 Difference]: Start difference. First operand 92 states and 133 transitions. Second operand 3 states. [2020-07-29 01:23:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:41,956 INFO L93 Difference]: Finished difference Result 92 states and 133 transitions. [2020-07-29 01:23:41,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:41,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-29 01:23:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-29 01:23:41,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2020-07-29 01:23:42,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:42,021 INFO L225 Difference]: With dead ends: 92 [2020-07-29 01:23:42,022 INFO L226 Difference]: Without dead ends: 91 [2020-07-29 01:23:42,022 INFO L675 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 [2020-07-29 01:23:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-29 01:23:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-07-29 01:23:42,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:42,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2020-07-29 01:23:42,031 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2020-07-29 01:23:42,031 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2020-07-29 01:23:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,036 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2020-07-29 01:23:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2020-07-29 01:23:42,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:42,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:42,037 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2020-07-29 01:23:42,038 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2020-07-29 01:23:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,043 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2020-07-29 01:23:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2020-07-29 01:23:42,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:42,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:42,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:42,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-29 01:23:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2020-07-29 01:23:42,049 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 7 [2020-07-29 01:23:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:42,050 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2020-07-29 01:23:42,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2020-07-29 01:23:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:23:42,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:42,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:42,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:23:42,052 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1541315113, now seen corresponding path program 1 times [2020-07-29 01:23:42,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:42,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296658259] [2020-07-29 01:23:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:42,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {1144#true} havoc main_#res;havoc main_#t~nondet5;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {1144#true} is VALID [2020-07-29 01:23:42,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {1144#true} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;assume -2147483648 <= f_#t~nondet0 && f_#t~nondet0 <= 2147483647;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;assume -2147483648 <= f_#t~nondet1 && f_#t~nondet1 <= 2147483647;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;assume -2147483648 <= f_#t~nondet2 && f_#t~nondet2 <= 2147483647;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !(f_~k~0 > 1073741823); {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,096 INFO L280 TraceCheckUtils]: 3: Hoare triple {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !(f_~z~0 < f_~k~0); {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,097 INFO L280 TraceCheckUtils]: 4: Hoare triple {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !!(f_~x~0 > 0 && f_~y~0 > 0);assume -2147483648 <= f_#t~nondet3 && f_#t~nondet3 <= 2147483647; {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3; {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {1146#(and (= 1 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !(f_~y~0 - f_~d <= 2147483647); {1145#false} is VALID [2020-07-29 01:23:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:42,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296658259] [2020-07-29 01:23:42,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:42,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:42,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648592779] [2020-07-29 01:23:42,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:42,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:42,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:42,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:42,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:42,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:42,114 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand 3 states. [2020-07-29 01:23:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,209 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2020-07-29 01:23:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:42,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2020-07-29 01:23:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2020-07-29 01:23:42,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2020-07-29 01:23:42,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:42,271 INFO L225 Difference]: With dead ends: 91 [2020-07-29 01:23:42,271 INFO L226 Difference]: Without dead ends: 90 [2020-07-29 01:23:42,272 INFO L675 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 [2020-07-29 01:23:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-29 01:23:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-07-29 01:23:42,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:42,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2020-07-29 01:23:42,278 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2020-07-29 01:23:42,279 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2020-07-29 01:23:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,283 INFO L93 Difference]: Finished difference Result 90 states and 125 transitions. [2020-07-29 01:23:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2020-07-29 01:23:42,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:42,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:42,284 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2020-07-29 01:23:42,285 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2020-07-29 01:23:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,289 INFO L93 Difference]: Finished difference Result 90 states and 125 transitions. [2020-07-29 01:23:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2020-07-29 01:23:42,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:42,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:42,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:42,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-29 01:23:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2020-07-29 01:23:42,295 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 7 [2020-07-29 01:23:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:42,296 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2020-07-29 01:23:42,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2020-07-29 01:23:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:23:42,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:42,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:42,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:23:42,298 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:42,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:42,299 INFO L82 PathProgramCache]: Analyzing trace with hash 26608055, now seen corresponding path program 1 times [2020-07-29 01:23:42,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:42,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359277347] [2020-07-29 01:23:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:42,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {1510#true} havoc main_#res;havoc main_#t~nondet5;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {1510#true} is VALID [2020-07-29 01:23:42,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {1510#true} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;assume -2147483648 <= f_#t~nondet0 && f_#t~nondet0 <= 2147483647;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;assume -2147483648 <= f_#t~nondet1 && f_#t~nondet1 <= 2147483647;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;assume -2147483648 <= f_#t~nondet2 && f_#t~nondet2 <= 2147483647;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !(f_~k~0 > 1073741823); {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,342 INFO L280 TraceCheckUtils]: 3: Hoare triple {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !(f_~z~0 < f_~k~0); {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !!(f_~x~0 > 0 && f_~y~0 > 0);assume -2147483648 <= f_#t~nondet3 && f_#t~nondet3 <= 2147483647; {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3; {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} is VALID [2020-07-29 01:23:42,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {1512#(and (= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 2147483647))} assume !(f_~y~0 - f_~d <= 2147483647); {1511#false} is VALID [2020-07-29 01:23:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:42,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359277347] [2020-07-29 01:23:42,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:42,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:42,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803487302] [2020-07-29 01:23:42,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:42,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:42,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:42,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:42,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:42,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:42,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:42,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:42,360 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand 3 states. [2020-07-29 01:23:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,450 INFO L93 Difference]: Finished difference Result 90 states and 125 transitions. [2020-07-29 01:23:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:42,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-29 01:23:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-29 01:23:42,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2020-07-29 01:23:42,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:42,521 INFO L225 Difference]: With dead ends: 90 [2020-07-29 01:23:42,521 INFO L226 Difference]: Without dead ends: 89 [2020-07-29 01:23:42,522 INFO L675 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 [2020-07-29 01:23:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-29 01:23:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-07-29 01:23:42,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:42,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2020-07-29 01:23:42,528 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2020-07-29 01:23:42,528 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2020-07-29 01:23:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,532 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2020-07-29 01:23:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-07-29 01:23:42,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:42,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:42,533 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2020-07-29 01:23:42,533 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2020-07-29 01:23:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,538 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2020-07-29 01:23:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-07-29 01:23:42,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:42,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:42,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:42,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-29 01:23:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2020-07-29 01:23:42,543 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 7 [2020-07-29 01:23:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:42,544 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2020-07-29 01:23:42,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2020-07-29 01:23:42,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-29 01:23:42,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:42,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:42,545 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:23:42,546 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:42,546 INFO L82 PathProgramCache]: Analyzing trace with hash 26607704, now seen corresponding path program 1 times [2020-07-29 01:23:42,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:42,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200822818] [2020-07-29 01:23:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:42,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {1872#true} havoc main_#res;havoc main_#t~nondet5;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; {1872#true} is VALID [2020-07-29 01:23:42,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {1872#true} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;assume -2147483648 <= f_#t~nondet0 && f_#t~nondet0 <= 2147483647;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;assume -2147483648 <= f_#t~nondet1 && f_#t~nondet1 <= 2147483647;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;assume -2147483648 <= f_#t~nondet2 && f_#t~nondet2 <= 2147483647;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:42,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} assume !(f_~k~0 > 1073741823); {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:42,583 INFO L280 TraceCheckUtils]: 3: Hoare triple {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} assume !(f_~z~0 < f_~k~0); {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:42,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} assume !!(f_~x~0 > 0 && f_~y~0 > 0);assume -2147483648 <= f_#t~nondet3 && f_#t~nondet3 <= 2147483647; {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:42,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:23:42,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {1874#(and (<= ULTIMATE.start_f_~x~0 2147483647) (= 2 ULTIMATE.start_f_~d))} assume !(f_~x~0 - f_~d <= 2147483647); {1873#false} is VALID [2020-07-29 01:23:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:23:42,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200822818] [2020-07-29 01:23:42,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:23:42,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:23:42,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582303482] [2020-07-29 01:23:42,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:42,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:23:42,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:23:42,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:42,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:23:42,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:23:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:23:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:23:42,601 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 3 states. [2020-07-29 01:23:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,673 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2020-07-29 01:23:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:23:42,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-29 01:23:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:23:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-29 01:23:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:23:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-29 01:23:42,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2020-07-29 01:23:42,729 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:23:42,731 INFO L225 Difference]: With dead ends: 89 [2020-07-29 01:23:42,731 INFO L226 Difference]: Without dead ends: 88 [2020-07-29 01:23:42,732 INFO L675 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 [2020-07-29 01:23:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-29 01:23:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-07-29 01:23:42,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:23:42,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2020-07-29 01:23:42,737 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2020-07-29 01:23:42,737 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2020-07-29 01:23:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,741 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2020-07-29 01:23:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2020-07-29 01:23:42,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:42,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:42,742 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2020-07-29 01:23:42,742 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2020-07-29 01:23:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:23:42,746 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2020-07-29 01:23:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2020-07-29 01:23:42,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:23:42,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:23:42,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:23:42,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:23:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-29 01:23:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2020-07-29 01:23:42,752 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 7 [2020-07-29 01:23:42,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:23:42,753 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2020-07-29 01:23:42,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:23:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2020-07-29 01:23:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-29 01:23:42,754 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:23:42,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:23:42,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-29 01:23:42,755 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2020-07-29 01:23:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:23:42,756 INFO L82 PathProgramCache]: Analyzing trace with hash -536139057, now seen corresponding path program 1 times [2020-07-29 01:23:42,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:23:42,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881317903] [2020-07-29 01:23:42,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:23:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:23:42,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-29 01:23:42,767 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:23:42,775 INFO L168 Benchmark]: Toolchain (without parser) took 3395.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.8 MB in the beginning and 847.5 MB in the end (delta: 103.3 MB). Peak memory consumption was 250.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:42,776 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:23:42,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.43 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:42,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:23:42,779 INFO L168 Benchmark]: Boogie Preprocessor took 94.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:42,780 INFO L168 Benchmark]: RCFGBuilder took 695.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:42,781 INFO L168 Benchmark]: TraceAbstraction took 2286.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 847.5 MB in the end (delta: 250.6 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:23:42,785 INFO L336 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.43 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 695.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2286.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 847.5 MB in the end (delta: 250.6 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...