./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.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/MutualRecursion_1a.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 c27ad91a5bec233234e07a14bfd5505e082df4cd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:01,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:50:01,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:50:01,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:50:01,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:50:01,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:50:01,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:50:01,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:50:01,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:50:01,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:50:01,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:50:01,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:50:01,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:50:01,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:50:01,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:50:01,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:50:01,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:50:01,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:50:01,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:50:01,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:50:01,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:50:01,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:50:01,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:50:01,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:50:01,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:50:01,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:50:01,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:50:01,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:50:01,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:50:01,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:50:01,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:50:01,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:50:01,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:50:01,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:50:01,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:50:01,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:50:01,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:50:01,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:50:01,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:50:01,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:50:01,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:50:01,425 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:01,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:50:01,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:50:01,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:50:01,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:50:01,452 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:50:01,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:50:01,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:50:01,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:50:01,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:50:01,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:50:01,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:50:01,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:50:01,454 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:50:01,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:50:01,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:50:01,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:50:01,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:50:01,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:50:01,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:50:01,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:50:01,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:50:01,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:50:01,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:50:01,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:50:01,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:50:01,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:50:01,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:50:01,459 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 -> c27ad91a5bec233234e07a14bfd5505e082df4cd [2019-11-28 02:50:01,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:50:01,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:50:01,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:50:01,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:50:01,765 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:50:01,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2019-11-28 02:50:01,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16471f2c6/53800c8366b04435b8e13e0272279af5/FLAGc1eb0fb36 [2019-11-28 02:50:02,258 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:50:02,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1a.c [2019-11-28 02:50:02,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16471f2c6/53800c8366b04435b8e13e0272279af5/FLAGc1eb0fb36 [2019-11-28 02:50:02,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16471f2c6/53800c8366b04435b8e13e0272279af5 [2019-11-28 02:50:02,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:50:02,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:50:02,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:02,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:50:02,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:50:02,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:02" (1/1) ... [2019-11-28 02:50:02,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606475e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:02, skipping insertion in model container [2019-11-28 02:50:02,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:50:02" (1/1) ... [2019-11-28 02:50:02,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:50:02,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:50:02,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:02,871 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:50:02,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:50:02,897 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:50:02,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:02 WrapperNode [2019-11-28 02:50:02,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:50:02,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:02,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:50:02,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:50:02,907 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:02" (1/1) ... [2019-11-28 02:50:02,911 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:02" (1/1) ... [2019-11-28 02:50:02,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:50:02,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:50:02,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:50:02,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:50:02,996 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:02" (1/1) ... [2019-11-28 02:50:02,997 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:02" (1/1) ... [2019-11-28 02:50:02,998 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:02" (1/1) ... [2019-11-28 02:50:02,998 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:02" (1/1) ... [2019-11-28 02:50:03,000 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:02" (1/1) ... [2019-11-28 02:50:03,002 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:02" (1/1) ... [2019-11-28 02:50:03,003 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:02" (1/1) ... [2019-11-28 02:50:03,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:50:03,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:50:03,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:50:03,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:50:03,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:02" (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:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 02:50:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 02:50:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 02:50:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 02:50:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:50:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:50:03,295 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:50:03,298 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:50:03,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:03 BoogieIcfgContainer [2019-11-28 02:50:03,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:50:03,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:50:03,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:50:03,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:50:03,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:50:02" (1/3) ... [2019-11-28 02:50:03,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6191168a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:03, skipping insertion in model container [2019-11-28 02:50:03,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:50:02" (2/3) ... [2019-11-28 02:50:03,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6191168a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:50:03, skipping insertion in model container [2019-11-28 02:50:03,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:50:03" (3/3) ... [2019-11-28 02:50:03,312 INFO L109 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a.c [2019-11-28 02:50:03,326 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:50:03,334 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-28 02:50:03,357 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-28 02:50:03,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:50:03,390 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:50:03,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:50:03,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:50:03,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:50:03,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:50:03,391 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:50:03,391 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:50:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-28 02:50:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 02:50:03,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:03,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 02:50:03,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-11-28 02:50:03,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:03,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19050284] [2019-11-28 02:50:03,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,600 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:03,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19050284] [2019-11-28 02:50:03,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:03,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:50:03,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822401820] [2019-11-28 02:50:03,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:03,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:03,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:03,621 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-11-28 02:50:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:03,754 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-28 02:50:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:03,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-28 02:50:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:03,766 INFO L225 Difference]: With dead ends: 64 [2019-11-28 02:50:03,767 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 02:50:03,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 02:50:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-11-28 02:50:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:50:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-28 02:50:03,822 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-28 02:50:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:03,822 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-28 02:50:03,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-28 02:50:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:50:03,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:03,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:50:03,824 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:03,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-11-28 02:50:03,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:03,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552192165] [2019-11-28 02:50:03,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:03,846 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:03,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552192165] [2019-11-28 02:50:03,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:03,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:03,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920755689] [2019-11-28 02:50:03,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:03,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:03,853 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-28 02:50:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:03,877 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-28 02:50:03,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:03,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 02:50:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:03,880 INFO L225 Difference]: With dead ends: 52 [2019-11-28 02:50:03,880 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 02:50:03,881 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:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 02:50:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-28 02:50:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:50:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-11-28 02:50:03,895 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-11-28 02:50:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:03,895 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-11-28 02:50:03,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-11-28 02:50:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 02:50:03,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:03,898 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:03,899 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-11-28 02:50:03,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:03,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954303290] [2019-11-28 02:50:03,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:50:04,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954303290] [2019-11-28 02:50:04,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:04,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 02:50:04,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153342057] [2019-11-28 02:50:04,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:50:04,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:50:04,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:04,007 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 9 states. [2019-11-28 02:50:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:04,227 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-11-28 02:50:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:50:04,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-11-28 02:50:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:04,233 INFO L225 Difference]: With dead ends: 66 [2019-11-28 02:50:04,233 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 02:50:04,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:50:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 02:50:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-28 02:50:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 02:50:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-11-28 02:50:04,255 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 13 [2019-11-28 02:50:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:04,261 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-11-28 02:50:04,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:50:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-11-28 02:50:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:50:04,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:04,264 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:04,265 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:04,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-11-28 02:50:04,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:04,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448077346] [2019-11-28 02:50:04,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,309 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:04,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448077346] [2019-11-28 02:50:04,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:04,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:50:04,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544974892] [2019-11-28 02:50:04,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:50:04,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:04,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:50:04,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:50:04,312 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2019-11-28 02:50:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:04,339 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-11-28 02:50:04,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:50:04,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:50:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:04,341 INFO L225 Difference]: With dead ends: 61 [2019-11-28 02:50:04,341 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 02:50:04,342 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:04,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 02:50:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-28 02:50:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 02:50:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-28 02:50:04,354 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 17 [2019-11-28 02:50:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:04,355 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-28 02:50:04,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:50:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-28 02:50:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:50:04,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:04,357 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:04,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-11-28 02:50:04,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:04,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853351161] [2019-11-28 02:50:04,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:50:04,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853351161] [2019-11-28 02:50:04,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:04,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:50:04,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089797646] [2019-11-28 02:50:04,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:04,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:04,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:04,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:04,457 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-11-28 02:50:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:04,525 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-28 02:50:04,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:04,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 02:50:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:04,530 INFO L225 Difference]: With dead ends: 93 [2019-11-28 02:50:04,530 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 02:50:04,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 02:50:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2019-11-28 02:50:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:50:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-11-28 02:50:04,556 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 21 [2019-11-28 02:50:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:04,557 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-28 02:50:04,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2019-11-28 02:50:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:50:04,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:04,558 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:04,559 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:04,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-11-28 02:50:04,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:04,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121012809] [2019-11-28 02:50:04,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:50:04,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121012809] [2019-11-28 02:50:04,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:50:04,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:50:04,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255706280] [2019-11-28 02:50:04,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:04,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:04,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:04,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:50:04,648 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 5 states. [2019-11-28 02:50:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:04,704 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2019-11-28 02:50:04,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:50:04,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 02:50:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:04,707 INFO L225 Difference]: With dead ends: 93 [2019-11-28 02:50:04,707 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 02:50:04,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:50:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 02:50:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2019-11-28 02:50:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:50:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-11-28 02:50:04,738 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 22 [2019-11-28 02:50:04,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:04,739 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-11-28 02:50:04,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-11-28 02:50:04,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:50:04,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:04,741 INFO L410 BasicCegarLoop]: trace histogram [3, 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:04,743 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2082036524, now seen corresponding path program 1 times [2019-11-28 02:50:04,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:04,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990222142] [2019-11-28 02:50:04,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:50:04,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990222142] [2019-11-28 02:50:04,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639761182] [2019-11-28 02:50:04,950 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:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:05,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:50:05,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:05,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2019-11-28 02:50:05,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176998346] [2019-11-28 02:50:05,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:50:05,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:05,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:50:05,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:50:05,105 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 14 states. [2019-11-28 02:50:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:05,500 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2019-11-28 02:50:05,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:50:05,501 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-28 02:50:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:05,503 INFO L225 Difference]: With dead ends: 191 [2019-11-28 02:50:05,503 INFO L226 Difference]: Without dead ends: 120 [2019-11-28 02:50:05,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:50:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-28 02:50:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2019-11-28 02:50:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:50:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-11-28 02:50:05,520 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 32 [2019-11-28 02:50:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:05,520 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-11-28 02:50:05,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:50:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2019-11-28 02:50:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:50:05,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:05,522 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:50:05,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:05,727 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:05,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1488102097, now seen corresponding path program 1 times [2019-11-28 02:50:05,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:05,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633092546] [2019-11-28 02:50:05,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 02:50:05,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633092546] [2019-11-28 02:50:05,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131446227] [2019-11-28 02:50:05,825 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) [2019-11-28 02:50:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:05,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:50:05,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:50:05,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:50:05,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-28 02:50:05,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693110312] [2019-11-28 02:50:05,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:50:05,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:50:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:50:05,889 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 5 states. [2019-11-28 02:50:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:05,964 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2019-11-28 02:50:05,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:50:05,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 02:50:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:05,966 INFO L225 Difference]: With dead ends: 153 [2019-11-28 02:50:05,966 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:50:05,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:50:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:50:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-28 02:50:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 02:50:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2019-11-28 02:50:05,977 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2019-11-28 02:50:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:05,977 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-11-28 02:50:05,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:50:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2019-11-28 02:50:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 02:50:05,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:50:05,982 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 02:50:06,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:06,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:50:06,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:50:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash 627143089, now seen corresponding path program 1 times [2019-11-28 02:50:06,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:50:06,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188275142] [2019-11-28 02:50:06,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:50:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 61 proven. 16 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-28 02:50:06,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188275142] [2019-11-28 02:50:06,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845008151] [2019-11-28 02:50:06,549 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:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:50:06,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:50:06,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:50:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-28 02:50:06,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:50:06,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-11-28 02:50:06,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766831291] [2019-11-28 02:50:06,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 02:50:06,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:50:06,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 02:50:06,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:50:06,743 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 19 states. [2019-11-28 02:50:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:50:07,088 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2019-11-28 02:50:07,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:50:07,090 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2019-11-28 02:50:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:50:07,091 INFO L225 Difference]: With dead ends: 119 [2019-11-28 02:50:07,091 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:50:07,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2019-11-28 02:50:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:50:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:50:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:50:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:50:07,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-11-28 02:50:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:50:07,094 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:50:07,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 02:50:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:50:07,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:50:07,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:50:07,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:50:07,537 INFO L246 CegarLoopResult]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-11-28 02:50:07,537 INFO L242 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (or (and (<= 1 f_~x) (= |f_#in~x| f_~x)) (not (<= |f_#in~x| 2147483646))) [2019-11-28 02:50:07,537 INFO L246 CegarLoopResult]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-11-28 02:50:07,538 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,538 INFO L246 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,538 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,538 INFO L242 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (or (and (<= (+ |f_#t~ret0| 1) f_~x) (<= 1 f_~x) (= |f_#in~x| f_~x)) (not (<= |f_#in~x| 2147483646))) [2019-11-28 02:50:07,538 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,539 INFO L246 CegarLoopResult]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,539 INFO L246 CegarLoopResult]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,539 INFO L246 CegarLoopResult]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,539 INFO L246 CegarLoopResult]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-11-28 02:50:07,539 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,539 INFO L249 CegarLoopResult]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-11-28 02:50:07,540 INFO L246 CegarLoopResult]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,540 INFO L246 CegarLoopResult]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 02:50:07,540 INFO L246 CegarLoopResult]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-11-28 02:50:07,540 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,541 INFO L246 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-11-28 02:50:07,541 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,541 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= |g_#in~x| g_~x) (not (<= |g_#in~x| 2147483647))) (or (<= 1 g_~x) (not (<= |g_#in~x| 2147483646)))) [2019-11-28 02:50:07,541 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,541 INFO L246 CegarLoopResult]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,541 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,542 INFO L242 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (and (or (<= |g_#in~x| 1) (not (<= |g_#in~x| 2147483647))) (or (and (<= 0 |g_#t~ret2|) (<= 1 g_~x) (<= |g_#t~ret2| 0) (= |g_#in~x| g_~x)) (not (<= |g_#in~x| 2147483646)))) [2019-11-28 02:50:07,542 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,542 INFO L246 CegarLoopResult]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,542 INFO L246 CegarLoopResult]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,542 INFO L246 CegarLoopResult]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,542 INFO L246 CegarLoopResult]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-11-28 02:50:07,542 INFO L246 CegarLoopResult]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,542 INFO L249 CegarLoopResult]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-11-28 02:50:07,542 INFO L246 CegarLoopResult]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,543 INFO L246 CegarLoopResult]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,543 INFO L246 CegarLoopResult]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,543 INFO L246 CegarLoopResult]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:50:07,543 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:50:07,543 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:50:07,543 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:50:07,543 INFO L242 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 02:50:07,543 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-28 02:50:07,544 INFO L246 CegarLoopResult]: For program point L24(lines 24 27) no Hoare annotation was computed. [2019-11-28 02:50:07,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:50:07 BoogieIcfgContainer [2019-11-28 02:50:07,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:50:07,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:50:07,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:50:07,550 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:50:07,550 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:03" (3/4) ... [2019-11-28 02:50:07,553 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:50:07,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-28 02:50:07,560 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-28 02:50:07,565 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:50:07,565 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:50:07,614 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:50:07,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:50:07,616 INFO L168 Benchmark]: Toolchain (without parser) took 4958.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,617 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:50:07,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.68 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 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:07,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,619 INFO L168 Benchmark]: Boogie Preprocessor took 15.70 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,622 INFO L168 Benchmark]: RCFGBuilder took 295.08 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,623 INFO L168 Benchmark]: TraceAbstraction took 4247.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.8 MB). Peak memory consumption was 63.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:50:07,623 INFO L168 Benchmark]: Witness Printer took 64.72 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:07,629 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.68 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 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 90.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.70 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 295.08 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4247.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.8 MB). Peak memory consumption was 63.1 MB. Max. memory is 11.5 GB. * Witness Printer took 64.72 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. * 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: 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 - 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, 42 locations, 10 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 9, TraceHistogramMax: 8, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 273 SDtfs, 294 SDslu, 819 SDs, 0 SdLazy, 770 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 81 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 109 PreInvPairs, 115 NumberOfFragments, 78 HoareAnnotationTreeSize, 109 FomulaSimplifications, 72 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 159 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 384 NumberOfCodeBlocks, 384 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 43667 SizeOfPredicates, 8 NumberOfNonLiveVariables, 309 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 360/385 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...