./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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/NestedRecursion_1d.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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:50:05,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:50:05,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:50:05,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:50:05,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:50:05,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:50:05,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:50:05,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:50:05,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:50:05,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:50:05,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:50:05,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:50:05,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:50:05,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:50:05,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:50:05,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:50:05,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:50:05,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:50:05,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:50:05,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:50:05,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:50:05,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:50:05,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:50:05,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:50:05,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:50:05,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:50:05,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:50:05,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:50:05,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:50:05,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:50:05,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:50:05,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:50:05,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:50:05,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:50:05,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:50:05,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:50:05,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:50:05,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:50:05,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:50:05,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:50:05,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:50:05,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 02:50:05,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:50:05,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:50:05,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:50:05,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:50:05,905 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:50:05,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:50:05,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:50:05,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:50:05,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:50:05,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:50:05,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:50:05,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:50:05,908 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:50:05,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:50:05,909 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:50:05,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:50:05,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:50:05,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:50:05,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:50:05,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:50:05,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:50:05,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:50:05,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:50:05,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:50:05,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:50:05,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:50:05,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:50:05,913 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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2019-11-28 02:50:06,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:50:06,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:50:06,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:50:06,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:50:06,214 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:50:06,215 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-28 02:50:06,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c017225/8466b04282e0494a9a7c9774671b8d28/FLAG27ceba890 [2019-11-28 02:50:06,727 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:50:06,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2019-11-28 02:50:06,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c017225/8466b04282e0494a9a7c9774671b8d28/FLAG27ceba890 [2019-11-28 02:50:07,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c017225/8466b04282e0494a9a7c9774671b8d28 [2019-11-28 02:50:07,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:50:07,164 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:50:07,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:07,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:50:07,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:50:07,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339275c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07, skipping insertion in model container [2019-11-28 02:50:07,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:50:07,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:50:07,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:07,362 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:50:07,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:07,393 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:50:07,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07 WrapperNode [2019-11-28 02:50:07,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:07,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:07,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:50:07,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:50:07,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:07,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:50:07,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:50:07,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:50:07,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (1/1) ... [2019-11-28 02:50:07,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:50:07,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:50:07,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:50:07,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:50:07,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (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 [2019-11-28 02:50:07,556 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-28 02:50:07,556 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-28 02:50:07,556 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-28 02:50:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-28 02:50:07,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:50:07,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:50:07,793 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:50:07,793 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:50:07,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:07 BoogieIcfgContainer [2019-11-28 02:50:07,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:50:07,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:50:07,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:50:07,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:50:07,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:50:07" (1/3) ... [2019-11-28 02:50:07,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314b00ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:07, skipping insertion in model container [2019-11-28 02:50:07,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:07" (2/3) ... [2019-11-28 02:50:07,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314b00ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:07, skipping insertion in model container [2019-11-28 02:50:07,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:07" (3/3) ... [2019-11-28 02:50:07,815 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1d.c [2019-11-28 02:50:07,839 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:50:07,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-28 02:50:07,859 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-28 02:50:07,887 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:50:07,888 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:50:07,888 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:50:07,888 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:50:07,888 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:50:07,888 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:50:07,889 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:50:07,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:50:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-28 02:50:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:50:07,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:07,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:07,925 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:07,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1656652383, now seen corresponding path program 1 times [2019-11-28 02:50:07,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:07,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391707135] [2019-11-28 02:50:07,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:08,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391707135] [2019-11-28 02:50:08,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:08,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:08,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418918111] [2019-11-28 02:50:08,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:08,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:08,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:08,131 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2019-11-28 02:50:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:08,394 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-11-28 02:50:08,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:08,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-11-28 02:50:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:08,412 INFO L225 Difference]: With dead ends: 86 [2019-11-28 02:50:08,412 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 02:50:08,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 02:50:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2019-11-28 02:50:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 02:50:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-28 02:50:08,497 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 8 [2019-11-28 02:50:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:08,497 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-28 02:50:08,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-28 02:50:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 02:50:08,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:08,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:08,501 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -183383641, now seen corresponding path program 1 times [2019-11-28 02:50:08,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:08,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538286984] [2019-11-28 02:50:08,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:08,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538286984] [2019-11-28 02:50:08,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:08,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:08,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50754923] [2019-11-28 02:50:08,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:08,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:08,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:08,557 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-28 02:50:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:08,574 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2019-11-28 02:50:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:08,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 02:50:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:08,576 INFO L225 Difference]: With dead ends: 70 [2019-11-28 02:50:08,577 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 02:50:08,578 INFO L630 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 [2019-11-28 02:50:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 02:50:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-28 02:50:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:50:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2019-11-28 02:50:08,593 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 9 [2019-11-28 02:50:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:08,593 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2019-11-28 02:50:08,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2019-11-28 02:50:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:50:08,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:08,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:08,595 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash -138388889, now seen corresponding path program 1 times [2019-11-28 02:50:08,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:08,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163225290] [2019-11-28 02:50:08,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:08,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163225290] [2019-11-28 02:50:08,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:08,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:08,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904465343] [2019-11-28 02:50:08,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:08,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:08,621 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 3 states. [2019-11-28 02:50:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:08,638 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-28 02:50:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:08,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 02:50:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:08,640 INFO L225 Difference]: With dead ends: 65 [2019-11-28 02:50:08,640 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 02:50:08,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 02:50:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-28 02:50:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 02:50:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-11-28 02:50:08,658 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2019-11-28 02:50:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:08,658 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-11-28 02:50:08,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-11-28 02:50:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:50:08,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:08,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:08,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 4911801, now seen corresponding path program 1 times [2019-11-28 02:50:08,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:08,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465927903] [2019-11-28 02:50:08,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:08,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465927903] [2019-11-28 02:50:08,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:08,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:08,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972948275] [2019-11-28 02:50:08,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:08,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:08,719 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 4 states. [2019-11-28 02:50:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:08,758 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-11-28 02:50:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:08,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 02:50:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:08,760 INFO L225 Difference]: With dead ends: 85 [2019-11-28 02:50:08,760 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 02:50:08,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 02:50:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-11-28 02:50:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 02:50:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2019-11-28 02:50:08,776 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 12 [2019-11-28 02:50:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:08,776 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2019-11-28 02:50:08,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2019-11-28 02:50:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:50:08,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:08,778 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:08,778 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2115393736, now seen corresponding path program 1 times [2019-11-28 02:50:08,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:08,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146563020] [2019-11-28 02:50:08,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:08,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146563020] [2019-11-28 02:50:08,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:08,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:08,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312739146] [2019-11-28 02:50:08,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:08,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:08,826 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand 3 states. [2019-11-28 02:50:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:08,839 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-11-28 02:50:08,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:08,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 02:50:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:08,844 INFO L225 Difference]: With dead ends: 74 [2019-11-28 02:50:08,845 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 02:50:08,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 02:50:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 02:50:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 02:50:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2019-11-28 02:50:08,859 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 16 [2019-11-28 02:50:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:08,859 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2019-11-28 02:50:08,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2019-11-28 02:50:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:50:08,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:08,863 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:08,863 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1152696420, now seen corresponding path program 1 times [2019-11-28 02:50:08,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:08,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445492412] [2019-11-28 02:50:08,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:08,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445492412] [2019-11-28 02:50:08,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:08,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:08,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031087974] [2019-11-28 02:50:08,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:08,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:08,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:08,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:08,931 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand 4 states. [2019-11-28 02:50:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:08,964 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-28 02:50:08,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:08,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 02:50:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:08,968 INFO L225 Difference]: With dead ends: 94 [2019-11-28 02:50:08,968 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 02:50:08,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 02:50:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-11-28 02:50:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 02:50:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-11-28 02:50:08,982 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 17 [2019-11-28 02:50:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:08,983 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-11-28 02:50:08,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-11-28 02:50:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:50:08,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:08,985 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:08,985 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:08,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1079409517, now seen corresponding path program 1 times [2019-11-28 02:50:08,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:08,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978834427] [2019-11-28 02:50:08,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:09,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978834427] [2019-11-28 02:50:09,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70654630] [2019-11-28 02:50:09,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:50:09,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:09,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:09,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-28 02:50:09,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926846998] [2019-11-28 02:50:09,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:09,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:50:09,226 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 5 states. [2019-11-28 02:50:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:09,297 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2019-11-28 02:50:09,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:50:09,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 02:50:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:09,299 INFO L225 Difference]: With dead ends: 125 [2019-11-28 02:50:09,299 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 02:50:09,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:50:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 02:50:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-11-28 02:50:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 02:50:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-11-28 02:50:09,316 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2019-11-28 02:50:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:09,316 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-11-28 02:50:09,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-11-28 02:50:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:50:09,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:09,318 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:09,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:09,522 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:09,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1643853139, now seen corresponding path program 1 times [2019-11-28 02:50:09,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:09,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038317938] [2019-11-28 02:50:09,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:50:09,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038317938] [2019-11-28 02:50:09,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:09,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:09,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803647680] [2019-11-28 02:50:09,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:09,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:09,609 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 6 states. [2019-11-28 02:50:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:09,693 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-11-28 02:50:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:09,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 02:50:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:09,695 INFO L225 Difference]: With dead ends: 149 [2019-11-28 02:50:09,696 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 02:50:09,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:50:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 02:50:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2019-11-28 02:50:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 02:50:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2019-11-28 02:50:09,728 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 21 [2019-11-28 02:50:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:09,728 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2019-11-28 02:50:09,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2019-11-28 02:50:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:50:09,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:09,731 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:09,731 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:09,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash 883505486, now seen corresponding path program 1 times [2019-11-28 02:50:09,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:09,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506353582] [2019-11-28 02:50:09,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 02:50:09,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506353582] [2019-11-28 02:50:09,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:09,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:09,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343067988] [2019-11-28 02:50:09,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:09,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:09,794 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand 6 states. [2019-11-28 02:50:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:09,861 INFO L93 Difference]: Finished difference Result 158 states and 210 transitions. [2019-11-28 02:50:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:09,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-28 02:50:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:09,863 INFO L225 Difference]: With dead ends: 158 [2019-11-28 02:50:09,863 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 02:50:09,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 02:50:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2019-11-28 02:50:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 02:50:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-11-28 02:50:09,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 27 [2019-11-28 02:50:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:09,876 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-11-28 02:50:09,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-11-28 02:50:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:50:09,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:09,888 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:09,889 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1291302577, now seen corresponding path program 1 times [2019-11-28 02:50:09,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:09,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075256594] [2019-11-28 02:50:09,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 02:50:09,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075256594] [2019-11-28 02:50:09,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:09,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:09,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703779505] [2019-11-28 02:50:09,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:09,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:09,988 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 4 states. [2019-11-28 02:50:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,016 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2019-11-28 02:50:10,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:10,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-28 02:50:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,021 INFO L225 Difference]: With dead ends: 94 [2019-11-28 02:50:10,022 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 02:50:10,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 02:50:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-11-28 02:50:10,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 02:50:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-11-28 02:50:10,046 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 35 [2019-11-28 02:50:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,047 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-11-28 02:50:10,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-11-28 02:50:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 02:50:10,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,050 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:10,051 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1375674171, now seen corresponding path program 1 times [2019-11-28 02:50:10,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:10,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144347359] [2019-11-28 02:50:10,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 02:50:10,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144347359] [2019-11-28 02:50:10,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:10,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:10,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658647874] [2019-11-28 02:50:10,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:10,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:10,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:10,109 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 3 states. [2019-11-28 02:50:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,132 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-11-28 02:50:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:10,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 02:50:10,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,137 INFO L225 Difference]: With dead ends: 91 [2019-11-28 02:50:10,138 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 02:50:10,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 02:50:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-28 02:50:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 02:50:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2019-11-28 02:50:10,150 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 36 [2019-11-28 02:50:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,152 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2019-11-28 02:50:10,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2019-11-28 02:50:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 02:50:10,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,155 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:10,155 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 930510463, now seen corresponding path program 1 times [2019-11-28 02:50:10,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:10,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995761470] [2019-11-28 02:50:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:50:10,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995761470] [2019-11-28 02:50:10,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:10,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:10,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457822853] [2019-11-28 02:50:10,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:10,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:10,266 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand 6 states. [2019-11-28 02:50:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,301 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-11-28 02:50:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:10,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-28 02:50:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,303 INFO L225 Difference]: With dead ends: 90 [2019-11-28 02:50:10,303 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 02:50:10,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 02:50:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 02:50:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 02:50:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-28 02:50:10,312 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 36 [2019-11-28 02:50:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,313 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-28 02:50:10,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-28 02:50:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 02:50:10,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,314 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:10,315 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:10,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:10,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1111626321, now seen corresponding path program 1 times [2019-11-28 02:50:10,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:10,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954887167] [2019-11-28 02:50:10,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 02:50:10,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954887167] [2019-11-28 02:50:10,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:10,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:50:10,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685182572] [2019-11-28 02:50:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:50:10,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:10,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:50:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:10,406 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-28 02:50:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,469 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2019-11-28 02:50:10,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:50:10,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-28 02:50:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,472 INFO L225 Difference]: With dead ends: 99 [2019-11-28 02:50:10,472 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 02:50:10,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:50:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 02:50:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2019-11-28 02:50:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 02:50:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2019-11-28 02:50:10,485 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 46 [2019-11-28 02:50:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,485 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2019-11-28 02:50:10,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:50:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2019-11-28 02:50:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:50:10,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,487 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:10,487 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash 138300185, now seen corresponding path program 1 times [2019-11-28 02:50:10,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:10,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153324671] [2019-11-28 02:50:10,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-28 02:50:10,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153324671] [2019-11-28 02:50:10,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578983170] [2019-11-28 02:50:10,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:10,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:10,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 02:50:10,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:10,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2019-11-28 02:50:10,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138949735] [2019-11-28 02:50:10,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:50:10,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:50:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:10,716 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand 7 states. [2019-11-28 02:50:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:10,912 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-11-28 02:50:10,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:50:10,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 02:50:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:10,914 INFO L225 Difference]: With dead ends: 116 [2019-11-28 02:50:10,914 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 02:50:10,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:50:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 02:50:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-11-28 02:50:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 02:50:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2019-11-28 02:50:10,938 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 45 [2019-11-28 02:50:10,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:10,939 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2019-11-28 02:50:10,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:50:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2019-11-28 02:50:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:50:10,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:10,940 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:11,151 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1156205799, now seen corresponding path program 1 times [2019-11-28 02:50:11,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163731605] [2019-11-28 02:50:11,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:50:11,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163731605] [2019-11-28 02:50:11,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401909469] [2019-11-28 02:50:11,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:50:11,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 02:50:11,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:11,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-28 02:50:11,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086095868] [2019-11-28 02:50:11,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:50:11,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:50:11,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:11,319 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand 10 states. [2019-11-28 02:50:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,436 INFO L93 Difference]: Finished difference Result 224 states and 282 transitions. [2019-11-28 02:50:11,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:50:11,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-11-28 02:50:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,439 INFO L225 Difference]: With dead ends: 224 [2019-11-28 02:50:11,439 INFO L226 Difference]: Without dead ends: 145 [2019-11-28 02:50:11,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:50:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-28 02:50:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2019-11-28 02:50:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 02:50:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 164 transitions. [2019-11-28 02:50:11,453 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 164 transitions. Word has length 43 [2019-11-28 02:50:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,454 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 164 transitions. [2019-11-28 02:50:11,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:50:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2019-11-28 02:50:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:50:11,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,456 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:11,660 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1154921966, now seen corresponding path program 1 times [2019-11-28 02:50:11,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23486746] [2019-11-28 02:50:11,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 02:50:11,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23486746] [2019-11-28 02:50:11,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:11,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:11,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68059867] [2019-11-28 02:50:11,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:11,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:11,693 INFO L87 Difference]: Start difference. First operand 132 states and 164 transitions. Second operand 3 states. [2019-11-28 02:50:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,709 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2019-11-28 02:50:11,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:11,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-28 02:50:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,711 INFO L225 Difference]: With dead ends: 132 [2019-11-28 02:50:11,711 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 02:50:11,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 02:50:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 02:50:11,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 02:50:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2019-11-28 02:50:11,723 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 43 [2019-11-28 02:50:11,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,723 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2019-11-28 02:50:11,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2019-11-28 02:50:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 02:50:11,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,724 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,725 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842648, now seen corresponding path program 1 times [2019-11-28 02:50:11,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556553022] [2019-11-28 02:50:11,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 02:50:11,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556553022] [2019-11-28 02:50:11,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:11,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:11,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708798143] [2019-11-28 02:50:11,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:50:11,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:11,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:50:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:11,773 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand 4 states. [2019-11-28 02:50:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:11,800 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-11-28 02:50:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:50:11,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-28 02:50:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:11,803 INFO L225 Difference]: With dead ends: 140 [2019-11-28 02:50:11,803 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 02:50:11,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:50:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 02:50:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-28 02:50:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 02:50:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-11-28 02:50:11,817 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 44 [2019-11-28 02:50:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:11,818 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-11-28 02:50:11,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:50:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-11-28 02:50:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 02:50:11,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:11,820 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:11,821 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:11,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1995865818, now seen corresponding path program 2 times [2019-11-28 02:50:11,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:11,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960955880] [2019-11-28 02:50:11,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 60 proven. 32 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-28 02:50:11,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960955880] [2019-11-28 02:50:11,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166845305] [2019-11-28 02:50:11,994 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:12,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:50:12,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:50:12,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:50:12,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-28 02:50:12,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:12,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2019-11-28 02:50:12,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012680532] [2019-11-28 02:50:12,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:50:12,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:50:12,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:12,103 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 13 states. [2019-11-28 02:50:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:12,278 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-11-28 02:50:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:50:12,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 75 [2019-11-28 02:50:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:12,279 INFO L225 Difference]: With dead ends: 155 [2019-11-28 02:50:12,279 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:12,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:50:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:12,281 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-11-28 02:50:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:12,281 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:12,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:50:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:12,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:12,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:12,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:12,757 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 14 [2019-11-28 02:50:12,876 INFO L246 CegarLoopResult]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,876 INFO L246 CegarLoopResult]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-11-28 02:50:12,876 INFO L246 CegarLoopResult]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,876 INFO L246 CegarLoopResult]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-11-28 02:50:12,876 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,877 INFO L249 CegarLoopResult]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-11-28 02:50:12,877 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,877 INFO L246 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-11-28 02:50:12,877 INFO L242 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (or (not (<= |rec1_#in~i| 2147483647)) (and (= |rec1_#in~i| rec1_~i) (<= 1 rec1_~i))) [2019-11-28 02:50:12,877 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,877 INFO L246 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,877 INFO L246 CegarLoopResult]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,877 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,878 INFO L242 CegarLoopResult]: At program point L14-6(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or .cse0 (= |rec1_#in~i| rec1_~i)) (or .cse0 (and (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))))) [2019-11-28 02:50:12,878 INFO L246 CegarLoopResult]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,878 INFO L246 CegarLoopResult]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,878 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,878 INFO L246 CegarLoopResult]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,878 INFO L242 CegarLoopResult]: At program point L14-8(line 14) the Hoare annotation is: (let ((.cse0 (not (<= |rec1_#in~i| 2147483647)))) (and (or (and (<= |rec1_#t~ret1| 0) (<= 1 rec1_~i)) .cse0) (or (and (= |rec1_#in~i| rec1_~i) (<= |rec1_#t~ret0| 1)) .cse0))) [2019-11-28 02:50:12,878 INFO L246 CegarLoopResult]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,878 INFO L246 CegarLoopResult]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,879 INFO L246 CegarLoopResult]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-11-28 02:50:12,880 INFO L246 CegarLoopResult]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,880 INFO L246 CegarLoopResult]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-11-28 02:50:12,880 INFO L246 CegarLoopResult]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-11-28 02:50:12,880 INFO L242 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-28 02:50:12,880 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,880 INFO L246 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-11-28 02:50:12,881 INFO L246 CegarLoopResult]: For program point L20-2(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,881 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,881 INFO L242 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j) (<= 1 |rec2_#t~ret3|)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-11-28 02:50:12,881 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,881 INFO L246 CegarLoopResult]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,882 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,882 INFO L249 CegarLoopResult]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-11-28 02:50:12,882 INFO L246 CegarLoopResult]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,882 INFO L246 CegarLoopResult]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,882 INFO L246 CegarLoopResult]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:12,883 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:12,883 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:12,883 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:12,883 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 02:50:12,883 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-28 02:50:12,884 INFO L246 CegarLoopResult]: For program point L23(lines 23 26) no Hoare annotation was computed. [2019-11-28 02:50:12,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:12 BoogieIcfgContainer [2019-11-28 02:50:12,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:12,894 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:12,894 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:12,894 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:12,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:07" (3/4) ... [2019-11-28 02:50:12,899 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:12,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-11-28 02:50:12,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-11-28 02:50:12,916 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:50:12,916 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:50:12,994 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:12,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:12,995 INFO L168 Benchmark]: Toolchain (without parser) took 5831.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 961.7 MB in the beginning and 990.1 MB in the end (delta: -28.4 MB). Peak memory consumption was 181.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,996 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:12,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.01 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,997 INFO L168 Benchmark]: Boogie Preprocessor took 19.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:12,997 INFO L168 Benchmark]: RCFGBuilder took 293.21 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,999 INFO L168 Benchmark]: TraceAbstraction took 5096.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 123.1 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:12,999 INFO L168 Benchmark]: Witness Printer took 99.84 ms. Allocated memory is still 1.2 GB. Free memory was 997.4 MB in the beginning and 990.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:13,001 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 229.01 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 87.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 293.21 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5096.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 997.4 MB in the end (delta: 123.1 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. * Witness Printer took 99.84 ms. Allocated memory is still 1.2 GB. Free memory was 997.4 MB in the beginning and 990.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 10 error locations. Result: SAFE, OverallTime: 4.6s, OverallIterations: 18, TraceHistogramMax: 10, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 687 SDtfs, 232 SDslu, 1730 SDs, 0 SdLazy, 623 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 225 PreInvPairs, 234 NumberOfFragments, 103 HoareAnnotationTreeSize, 225 FomulaSimplifications, 618 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 49059 SizeOfPredicates, 6 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 688/756 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...