./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.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-2e94e6a [2019-01-01 20:34:16,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:16,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:16,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:16,275 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:16,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:16,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:16,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:16,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:16,289 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:16,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:16,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:16,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:16,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:16,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:16,300 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:16,301 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:16,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:16,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:16,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:16,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:16,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:16,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:16,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:16,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:16,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:16,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:16,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:16,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:16,337 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:16,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:16,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:16,338 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:16,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:16,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:16,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:16,342 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-01 20:34:16,370 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:16,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:16,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:16,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:16,376 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:16,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:16,376 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:16,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:16,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:16,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:16,377 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:16,377 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:16,377 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:16,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:16,378 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:16,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:16,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:16,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:16,379 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:16,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:16,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:16,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:16,380 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:16,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:16,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:16,381 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:16,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:16,382 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-01-01 20:34:16,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:16,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:16,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:16,453 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:16,453 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:16,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 20:34:16,513 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a931d4868/d7c58737360b45d4b36bac299ef6c4bc/FLAGfa5105a37 [2019-01-01 20:34:16,993 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:16,994 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 20:34:17,000 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a931d4868/d7c58737360b45d4b36bac299ef6c4bc/FLAGfa5105a37 [2019-01-01 20:34:17,333 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a931d4868/d7c58737360b45d4b36bac299ef6c4bc [2019-01-01 20:34:17,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:17,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:17,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:17,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:17,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:17,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175e6b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17, skipping insertion in model container [2019-01-01 20:34:17,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:17,373 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:17,616 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:17,624 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:17,648 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:17,668 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:17,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17 WrapperNode [2019-01-01 20:34:17,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:17,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:17,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:17,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:17,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:17,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:17,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:17,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:17,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (1/1) ... [2019-01-01 20:34:17,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:17,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:17,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:17,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:17,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (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-01-01 20:34:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 20:34:17,888 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 20:34:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 20:34:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 20:34:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:18,296 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:18,297 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:34:18,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:18 BoogieIcfgContainer [2019-01-01 20:34:18,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:18,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:18,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:18,302 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:18,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:17" (1/3) ... [2019-01-01 20:34:18,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3019c4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:18, skipping insertion in model container [2019-01-01 20:34:18,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:17" (2/3) ... [2019-01-01 20:34:18,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3019c4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:18, skipping insertion in model container [2019-01-01 20:34:18,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:18" (3/3) ... [2019-01-01 20:34:18,306 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2019-01-01 20:34:18,316 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:18,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-01-01 20:34:18,343 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-01-01 20:34:18,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:18,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:18,378 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:18,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:18,379 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:18,379 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:18,379 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:18,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:18,380 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-01-01 20:34:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-01 20:34:18,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:18,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-01 20:34:18,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:18,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:18,419 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-01-01 20:34:18,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:18,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:18,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:18,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:18,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:18,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:18,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:18,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:18,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:18,673 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-01-01 20:34:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:18,884 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-01-01 20:34:18,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:18,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-01 20:34:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:18,899 INFO L225 Difference]: With dead ends: 64 [2019-01-01 20:34:18,899 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 20:34:18,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 20:34:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-01 20:34:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-01 20:34:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-01-01 20:34:18,958 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-01-01 20:34:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:18,958 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-01-01 20:34:18,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-01-01 20:34:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:18,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:18,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:18,960 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-01-01 20:34:18,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:18,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:18,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:19,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:19,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:19,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:19,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:19,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:19,028 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-01-01 20:34:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:19,102 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-01-01 20:34:19,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:19,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-01 20:34:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:19,105 INFO L225 Difference]: With dead ends: 52 [2019-01-01 20:34:19,105 INFO L226 Difference]: Without dead ends: 50 [2019-01-01 20:34:19,107 INFO L631 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-01-01 20:34:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-01 20:34:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-01 20:34:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-01 20:34:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-01-01 20:34:19,118 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-01-01 20:34:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:19,119 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-01-01 20:34:19,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-01-01 20:34:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-01 20:34:19,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:19,121 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:19,121 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:19,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-01-01 20:34:19,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:19,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:19,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 20:34:19,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:19,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:19,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:19,406 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 7 states. [2019-01-01 20:34:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:19,797 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-01-01 20:34:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:34:19,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-01-01 20:34:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:19,802 INFO L225 Difference]: With dead ends: 67 [2019-01-01 20:34:19,803 INFO L226 Difference]: Without dead ends: 65 [2019-01-01 20:34:19,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-01 20:34:19,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-01-01 20:34:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-01 20:34:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-01-01 20:34:19,817 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 13 [2019-01-01 20:34:19,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:19,818 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-01-01 20:34:19,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-01-01 20:34:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 20:34:19,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:19,820 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:19,820 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash 407065914, now seen corresponding path program 1 times [2019-01-01 20:34:19,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:19,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:19,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:19,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:34:19,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:19,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:19,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:19,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:19,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:19,907 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2019-01-01 20:34:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,033 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2019-01-01 20:34:20,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:20,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-01 20:34:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,037 INFO L225 Difference]: With dead ends: 77 [2019-01-01 20:34:20,037 INFO L226 Difference]: Without dead ends: 76 [2019-01-01 20:34:20,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01-01 20:34:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-01 20:34:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-01-01 20:34:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 20:34:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-01-01 20:34:20,057 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 16 [2019-01-01 20:34:20,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,058 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-01-01 20:34:20,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-01-01 20:34:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:34:20,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,059 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:20,060 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,060 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-01-01 20:34:20,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:20,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:20,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:20,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:20,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:20,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:20,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:20,095 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 3 states. [2019-01-01 20:34:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,115 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-01-01 20:34:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:20,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-01 20:34:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,117 INFO L225 Difference]: With dead ends: 67 [2019-01-01 20:34:20,117 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 20:34:20,118 INFO L631 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-01-01 20:34:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 20:34:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-01-01 20:34:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-01 20:34:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-01-01 20:34:20,130 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 17 [2019-01-01 20:34:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,131 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-01-01 20:34:20,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-01-01 20:34:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:34:20,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,133 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:20,134 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash 182136625, now seen corresponding path program 1 times [2019-01-01 20:34:20,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:20,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:34:20,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:20,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:34:20,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:20,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:20,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:20,226 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2019-01-01 20:34:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,408 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2019-01-01 20:34:20,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:20,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 20:34:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,411 INFO L225 Difference]: With dead ends: 123 [2019-01-01 20:34:20,411 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 20:34:20,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-01 20:34:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 20:34:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-01-01 20:34:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 20:34:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2019-01-01 20:34:20,439 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 21 [2019-01-01 20:34:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,441 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2019-01-01 20:34:20,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2019-01-01 20:34:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-01 20:34:20,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,445 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:20,447 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-01-01 20:34:20,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:20,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:20,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:20,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:20,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:20,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:20,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:20,698 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 5 states. [2019-01-01 20:34:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:20,785 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2019-01-01 20:34:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:20,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-01 20:34:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:20,789 INFO L225 Difference]: With dead ends: 72 [2019-01-01 20:34:20,789 INFO L226 Difference]: Without dead ends: 71 [2019-01-01 20:34:20,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:20,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-01 20:34:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-01 20:34:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 20:34:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-01-01 20:34:20,801 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 21 [2019-01-01 20:34:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:20,802 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-01-01 20:34:20,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-01-01 20:34:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 20:34:20,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:20,804 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:20,805 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-01-01 20:34:20,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:20,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:20,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:20,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:20,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:20,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:20,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:20,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:20,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:20,920 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 5 states. [2019-01-01 20:34:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,055 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-01-01 20:34:21,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:21,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-01 20:34:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,059 INFO L225 Difference]: With dead ends: 75 [2019-01-01 20:34:21,059 INFO L226 Difference]: Without dead ends: 71 [2019-01-01 20:34:21,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-01 20:34:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-01-01 20:34:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-01 20:34:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-01-01 20:34:21,070 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 22 [2019-01-01 20:34:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,070 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-01-01 20:34:21,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-01-01 20:34:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-01 20:34:21,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,072 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:21,073 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 615433511, now seen corresponding path program 1 times [2019-01-01 20:34:21,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:21,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:21,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 20:34:21,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:21,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:21,164 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 7 states. [2019-01-01 20:34:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,444 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2019-01-01 20:34:21,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:21,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-01-01 20:34:21,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,447 INFO L225 Difference]: With dead ends: 107 [2019-01-01 20:34:21,447 INFO L226 Difference]: Without dead ends: 106 [2019-01-01 20:34:21,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-01 20:34:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-01-01 20:34:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 20:34:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-01-01 20:34:21,461 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 42 [2019-01-01 20:34:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,462 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-01-01 20:34:21,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-01-01 20:34:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 20:34:21,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,464 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:21,464 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,465 INFO L82 PathProgramCache]: Analyzing trace with hash 128559972, now seen corresponding path program 1 times [2019-01-01 20:34:21,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-01 20:34:21,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:21,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:21,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:21,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:21,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:21,564 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 5 states. [2019-01-01 20:34:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:21,671 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2019-01-01 20:34:21,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:21,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-01-01 20:34:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:21,675 INFO L225 Difference]: With dead ends: 81 [2019-01-01 20:34:21,675 INFO L226 Difference]: Without dead ends: 80 [2019-01-01 20:34:21,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-01-01 20:34:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-01 20:34:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-01 20:34:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-01 20:34:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2019-01-01 20:34:21,684 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 47 [2019-01-01 20:34:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:21,685 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2019-01-01 20:34:21,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2019-01-01 20:34:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-01 20:34:21,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:21,688 INFO L402 BasicCegarLoop]: trace histogram [7, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:21,689 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash 518188496, now seen corresponding path program 1 times [2019-01-01 20:34:21,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:21,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-01-01 20:34:21,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:21,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:21,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:21,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 65 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-01 20:34:22,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:22,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:34:22,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:22,052 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 7 states. [2019-01-01 20:34:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:22,372 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2019-01-01 20:34:22,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:22,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-01-01 20:34:22,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:22,375 INFO L225 Difference]: With dead ends: 168 [2019-01-01 20:34:22,375 INFO L226 Difference]: Without dead ends: 93 [2019-01-01 20:34:22,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-01 20:34:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2019-01-01 20:34:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-01 20:34:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2019-01-01 20:34:22,388 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 76 [2019-01-01 20:34:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:22,389 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2019-01-01 20:34:22,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2019-01-01 20:34:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 20:34:22,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:22,394 INFO L402 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-01-01 20:34:22,394 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:22,395 INFO L82 PathProgramCache]: Analyzing trace with hash 627143089, now seen corresponding path program 2 times [2019-01-01 20:34:22,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:22,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:22,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:22,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-01-01 20:34:22,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:22,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:22,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:22,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:22,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:22,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 35 proven. 13 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-01 20:34:22,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:22,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2019-01-01 20:34:22,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:34:22,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:34:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:22,989 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand 16 states. [2019-01-01 20:34:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:23,293 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2019-01-01 20:34:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:34:23,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-01-01 20:34:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:23,295 INFO L225 Difference]: With dead ends: 124 [2019-01-01 20:34:23,295 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:34:23,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:34:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:34:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:34:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:34:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:34:23,298 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-01-01 20:34:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:23,298 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:34:23,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:34:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:34:23,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:34:23,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:34:23,868 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2019-01-01 20:34:24,117 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-01-01 20:34:24,201 INFO L448 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,201 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-01-01 20:34:24,201 INFO L448 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,202 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (or (and (<= |f_#in~x| f_~x) (<= f_~x 2147483647) (<= 1 f_~x)) (< 2147483647 |f_#in~x|)) (< 0 (+ |f_#in~x| 1))) [2019-01-01 20:34:24,202 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-01-01 20:34:24,202 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,202 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,202 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,202 INFO L444 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (and (or (and (<= f_~x 2147483646) (<= |f_#in~x| f_~x) (<= |f_#t~ret0| 0) (<= 1 f_~x)) (< 2147483647 |f_#in~x|)) (< 0 (+ |f_#in~x| 1))) [2019-01-01 20:34:24,202 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,202 INFO L448 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,202 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-01-01 20:34:24,203 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,203 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-01-01 20:34:24,203 INFO L448 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,203 INFO L448 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-01-01 20:34:24,203 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-01-01 20:34:24,203 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,203 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-01-01 20:34:24,203 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,204 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= 1 g_~x) (<= g_~x 2147483647) (<= |g_#in~x| g_~x)) (< 2147483647 |g_#in~x|)) [2019-01-01 20:34:24,204 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,204 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,204 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,204 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,204 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (or (and (<= 1 g_~x) (<= 0 (+ |g_#t~ret2| 2147483648)) (<= g_~x 1) (<= |g_#t~ret2| 0) (<= |g_#in~x| 1)) (< 2147483647 |g_#in~x|)) [2019-01-01 20:34:24,204 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,204 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,205 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,207 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-01-01 20:34:24,207 INFO L448 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,207 INFO L448 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,208 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,208 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,208 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-01-01 20:34:24,208 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 20:34:24,208 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:34:24,208 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:34:24,208 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:34:24,208 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-01 20:34:24,209 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-01-01 20:34:24,209 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 27) no Hoare annotation was computed. [2019-01-01 20:34:24,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:24 BoogieIcfgContainer [2019-01-01 20:34:24,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:24,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:24,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:24,216 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:24,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:18" (3/4) ... [2019-01-01 20:34:24,221 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:34:24,227 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-01 20:34:24,228 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-01 20:34:24,233 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 20:34:24,234 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:34:24,291 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:24,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:24,293 INFO L168 Benchmark]: Toolchain (without parser) took 6956.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -216.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:24,293 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:24,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:24,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.99 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:24,295 INFO L168 Benchmark]: Boogie Preprocessor took 33.16 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:24,295 INFO L168 Benchmark]: RCFGBuilder took 548.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:24,296 INFO L168 Benchmark]: TraceAbstraction took 5915.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.8 MB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:24,297 INFO L168 Benchmark]: Witness Printer took 76.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:24,300 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 939.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.99 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.16 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 548.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5915.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.8 MB). Peak memory consumption was 313.9 MB. Max. memory is 11.5 GB. * Witness Printer took 76.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 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. SAFE Result, 5.8s OverallTime, 12 OverallIterations, 8 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 368 SDtfs, 302 SDslu, 877 SDs, 0 SdLazy, 625 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 72 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 100 PreInvPairs, 106 NumberOfFragments, 90 HoareAnnotationTreeSize, 100 FomulaSimplifications, 170 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 130 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 536 ConstructedInterpolants, 0 QuantifiedInterpolants, 53457 SizeOfPredicates, 3 NumberOfNonLiveVariables, 340 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 601/647 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...