./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.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 9072a9376e1e28de1ef4dc11b7134f6f175023b7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:22:33,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:22:33,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:22:33,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:22:33,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:22:33,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:22:33,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:22:33,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:22:33,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:22:33,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:22:33,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:22:33,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:22:33,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:22:33,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:22:33,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:22:33,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:22:33,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:22:33,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:22:33,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:22:33,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:22:33,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:22:33,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:22:33,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:22:33,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:22:33,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:22:33,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:22:33,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:22:33,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:22:33,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:22:33,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:22:33,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:22:33,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:22:33,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:22:33,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:22:33,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:22:33,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:22:33,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:22:33,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:22:33,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:22:33,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:22:33,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:22:33,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:22:34,010 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:22:34,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:22:34,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:22:34,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:22:34,013 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:22:34,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:22:34,014 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:22:34,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:22:34,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:22:34,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:22:34,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:22:34,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:22:34,015 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:22:34,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:22:34,016 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:22:34,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:22:34,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:22:34,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:22:34,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:22:34,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:22:34,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:34,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:22:34,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:22:34,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:22:34,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:22:34,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:22:34,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:22:34,019 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:22:34,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9072a9376e1e28de1ef4dc11b7134f6f175023b7 [2019-11-28 20:22:34,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:22:34,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:22:34,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:22:34,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:22:34,355 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:22:34,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2019-11-28 20:22:34,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05a8790c/901884a512d8453bb0fc7c5fb6a5caf8/FLAG422dfc39d [2019-11-28 20:22:34,880 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:22:34,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2019-11-28 20:22:34,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05a8790c/901884a512d8453bb0fc7c5fb6a5caf8/FLAG422dfc39d [2019-11-28 20:22:35,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c05a8790c/901884a512d8453bb0fc7c5fb6a5caf8 [2019-11-28 20:22:35,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:22:35,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:22:35,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:35,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:22:35,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:22:35,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c6b718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35, skipping insertion in model container [2019-11-28 20:22:35,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:22:35,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:22:35,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:35,436 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:22:35,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:22:35,459 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:22:35,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35 WrapperNode [2019-11-28 20:22:35,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:22:35,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:35,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:22:35,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:22:35,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:22:35,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:22:35,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:22:35,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:22:35,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... [2019-11-28 20:22:35,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:22:35,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:22:35,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:22:35,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:22:35,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:22:35,618 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 20:22:35,619 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 20:22:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 20:22:35,619 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 20:22:35,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:22:35,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:22:35,882 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:22:35,883 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 20:22:35,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:35 BoogieIcfgContainer [2019-11-28 20:22:35,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:22:35,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:22:35,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:22:35,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:22:35,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:22:35" (1/3) ... [2019-11-28 20:22:35,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5093ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:35, skipping insertion in model container [2019-11-28 20:22:35,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:22:35" (2/3) ... [2019-11-28 20:22:35,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5093ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:22:35, skipping insertion in model container [2019-11-28 20:22:35,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:35" (3/3) ... [2019-11-28 20:22:35,907 INFO L109 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b.c [2019-11-28 20:22:35,920 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:22:35,930 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-28 20:22:35,941 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-28 20:22:35,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:22:35,967 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:22:35,968 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:22:35,968 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:22:35,968 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:22:35,968 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:22:35,968 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:22:35,968 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:22:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-28 20:22:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:22:35,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:35,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:22:35,995 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,000 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-11-28 20:22:36,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706099184] [2019-11-28 20:22:36,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706099184] [2019-11-28 20:22:36,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:36,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:22:36,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142999676] [2019-11-28 20:22:36,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:36,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:36,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:36,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:36,225 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-11-28 20:22:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,355 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-28 20:22:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:36,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-28 20:22:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,371 INFO L225 Difference]: With dead ends: 64 [2019-11-28 20:22:36,371 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:22:36,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:22:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-11-28 20:22:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:22:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-28 20:22:36,439 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-28 20:22:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:36,440 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-28 20:22:36,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-28 20:22:36,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:22:36,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:22:36,443 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-11-28 20:22:36,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476658277] [2019-11-28 20:22:36,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476658277] [2019-11-28 20:22:36,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:36,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:36,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325559325] [2019-11-28 20:22:36,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:36,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:36,471 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-28 20:22:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,510 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-28 20:22:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:36,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 20:22:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,513 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:22:36,514 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 20:22:36,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 20:22:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-28 20:22:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:22:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-11-28 20:22:36,549 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-11-28 20:22:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:36,550 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-11-28 20:22:36,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-11-28 20:22:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:22:36,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,552 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:36,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,553 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-11-28 20:22:36,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207577607] [2019-11-28 20:22:36,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:22:36,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207577607] [2019-11-28 20:22:36,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:36,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:22:36,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101077068] [2019-11-28 20:22:36,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:22:36,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:22:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:36,698 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 9 states. [2019-11-28 20:22:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:36,934 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-11-28 20:22:36,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:22:36,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-11-28 20:22:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:36,938 INFO L225 Difference]: With dead ends: 66 [2019-11-28 20:22:36,938 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 20:22:36,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:22:36,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 20:22:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-28 20:22:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 20:22:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-11-28 20:22:36,961 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 13 [2019-11-28 20:22:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:36,961 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-11-28 20:22:36,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:22:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-11-28 20:22:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:22:36,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:36,965 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:36,965 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:36,966 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-11-28 20:22:36,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:36,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713743509] [2019-11-28 20:22:36,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:22:37,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713743509] [2019-11-28 20:22:37,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:22:37,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616674950] [2019-11-28 20:22:37,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:22:37,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:22:37,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:37,031 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2019-11-28 20:22:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,053 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-11-28 20:22:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:22:37,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 20:22:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,056 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:22:37,057 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 20:22:37,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:22:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 20:22:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-28 20:22:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 20:22:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-28 20:22:37,080 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 17 [2019-11-28 20:22:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,081 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-28 20:22:37,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:22:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-28 20:22:37,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:22:37,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,083 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,086 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-11-28 20:22:37,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977765589] [2019-11-28 20:22:37,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:37,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977765589] [2019-11-28 20:22:37,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:22:37,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903100086] [2019-11-28 20:22:37,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:37,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:37,181 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-11-28 20:22:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,270 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-28 20:22:37,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:37,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 20:22:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,275 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:22:37,275 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 20:22:37,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 20:22:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2019-11-28 20:22:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:22:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-11-28 20:22:37,308 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 21 [2019-11-28 20:22:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,308 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-28 20:22:37,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2019-11-28 20:22:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:22:37,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,312 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,312 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-11-28 20:22:37,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355268364] [2019-11-28 20:22:37,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:37,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355268364] [2019-11-28 20:22:37,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:37,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:22:37,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737160802] [2019-11-28 20:22:37,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:37,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:37,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:22:37,421 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 5 states. [2019-11-28 20:22:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:37,494 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2019-11-28 20:22:37,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:22:37,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 20:22:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:37,500 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:22:37,500 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 20:22:37,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:22:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 20:22:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2019-11-28 20:22:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:22:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-11-28 20:22:37,526 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 22 [2019-11-28 20:22:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:37,531 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-11-28 20:22:37,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-11-28 20:22:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:22:37,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:37,536 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:37,536 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:37,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2082036524, now seen corresponding path program 1 times [2019-11-28 20:22:37,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:37,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238104322] [2019-11-28 20:22:37,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:37,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238104322] [2019-11-28 20:22:37,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065549795] [2019-11-28 20:22:37,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:37,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:22:37,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:22:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:37,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:22:37,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2019-11-28 20:22:37,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183171196] [2019-11-28 20:22:37,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:22:37,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:37,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:22:37,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:22:37,903 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 14 states. [2019-11-28 20:22:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,297 INFO L93 Difference]: Finished difference Result 198 states and 268 transitions. [2019-11-28 20:22:38,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:22:38,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-28 20:22:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,301 INFO L225 Difference]: With dead ends: 198 [2019-11-28 20:22:38,302 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 20:22:38,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:22:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 20:22:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103. [2019-11-28 20:22:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 20:22:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2019-11-28 20:22:38,338 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 32 [2019-11-28 20:22:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,339 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2019-11-28 20:22:38,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:22:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2019-11-28 20:22:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:22:38,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,347 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:38,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:38,554 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1488102097, now seen corresponding path program 1 times [2019-11-28 20:22:38,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:38,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708886064] [2019-11-28 20:22:38,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:22:38,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708886064] [2019-11-28 20:22:38,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833553823] [2019-11-28 20:22:38,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:22:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:38,685 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:22:38,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:22:38,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:22:38,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-28 20:22:38,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238348259] [2019-11-28 20:22:38,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:22:38,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:38,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:22:38,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:22:38,723 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand 5 states. [2019-11-28 20:22:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:38,800 INFO L93 Difference]: Finished difference Result 178 states and 234 transitions. [2019-11-28 20:22:38,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:22:38,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 20:22:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:38,803 INFO L225 Difference]: With dead ends: 178 [2019-11-28 20:22:38,803 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 20:22:38,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:22:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 20:22:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-28 20:22:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:22:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-11-28 20:22:38,816 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 24 [2019-11-28 20:22:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:38,816 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-11-28 20:22:38,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:22:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2019-11-28 20:22:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 20:22:38,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:38,820 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 20:22:39,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:22:39,032 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:39,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:39,033 INFO L82 PathProgramCache]: Analyzing trace with hash 627143089, now seen corresponding path program 1 times [2019-11-28 20:22:39,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:39,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783826014] [2019-11-28 20:22:39,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-28 20:22:39,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783826014] [2019-11-28 20:22:39,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:39,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:22:39,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708508723] [2019-11-28 20:22:39,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:22:39,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:39,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:22:39,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:22:39,281 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 8 states. [2019-11-28 20:22:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,345 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-11-28 20:22:39,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:22:39,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-11-28 20:22:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,350 INFO L225 Difference]: With dead ends: 78 [2019-11-28 20:22:39,351 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 20:22:39,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:22:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 20:22:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-28 20:22:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 20:22:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-11-28 20:22:39,365 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 94 [2019-11-28 20:22:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,369 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-11-28 20:22:39,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:22:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-11-28 20:22:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 20:22:39,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:22:39,376 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:22:39,376 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:22:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:22:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash -319407487, now seen corresponding path program 1 times [2019-11-28 20:22:39,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:22:39,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189783127] [2019-11-28 20:22:39,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:22:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:22:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-28 20:22:39,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189783127] [2019-11-28 20:22:39,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:22:39,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:22:39,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300128705] [2019-11-28 20:22:39,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:22:39,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:22:39,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:22:39,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:22:39,560 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 8 states. [2019-11-28 20:22:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:22:39,619 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-11-28 20:22:39,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:22:39,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-11-28 20:22:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:22:39,621 INFO L225 Difference]: With dead ends: 76 [2019-11-28 20:22:39,621 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:22:39,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:22:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:22:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:22:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:22:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:22:39,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2019-11-28 20:22:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:22:39,624 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:22:39,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:22:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:22:39,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:22:39,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:22:39,908 INFO L246 CegarLoopResult]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-11-28 20:22:39,908 INFO L242 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (or (and (<= 1 f_~x) (= |f_#in~x| f_~x)) (not (<= |f_#in~x| 2147483645))) [2019-11-28 20:22:39,908 INFO L246 CegarLoopResult]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-11-28 20:22:39,908 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,908 INFO L246 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,909 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,909 INFO L242 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (or (and (<= 0 |f_#t~ret0|) (<= |f_#t~ret0| 0) (<= 1 f_~x) (= |f_#in~x| f_~x)) (not (<= |f_#in~x| 2147483645))) [2019-11-28 20:22:39,909 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,909 INFO L246 CegarLoopResult]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,909 INFO L246 CegarLoopResult]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,909 INFO L246 CegarLoopResult]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,909 INFO L246 CegarLoopResult]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-11-28 20:22:39,909 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,910 INFO L249 CegarLoopResult]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-11-28 20:22:39,910 INFO L246 CegarLoopResult]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,910 INFO L246 CegarLoopResult]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-11-28 20:22:39,910 INFO L246 CegarLoopResult]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:22:39,910 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,910 INFO L246 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-11-28 20:22:39,910 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,910 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= |g_#in~x| g_~x) (not (<= |g_#in~x| 2147483647))) (or (not (<= |g_#in~x| 2147483645)) (<= 1 g_~x))) [2019-11-28 20:22:39,911 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,914 INFO L246 CegarLoopResult]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,915 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,915 INFO L242 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (or (and (<= 0 |g_#t~ret2|) (<= 1 g_~x) (<= |g_#t~ret2| 0) (= |g_#in~x| g_~x)) (not (<= |g_#in~x| 2147483647))) [2019-11-28 20:22:39,915 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,915 INFO L246 CegarLoopResult]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,916 INFO L246 CegarLoopResult]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,916 INFO L246 CegarLoopResult]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,916 INFO L246 CegarLoopResult]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-11-28 20:22:39,916 INFO L246 CegarLoopResult]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,916 INFO L249 CegarLoopResult]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-11-28 20:22:39,917 INFO L246 CegarLoopResult]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,917 INFO L246 CegarLoopResult]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,917 INFO L246 CegarLoopResult]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,917 INFO L246 CegarLoopResult]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 20:22:39,917 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:22:39,918 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:22:39,918 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:22:39,918 INFO L242 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-11-28 20:22:39,918 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-11-28 20:22:39,918 INFO L246 CegarLoopResult]: For program point L24(lines 24 27) no Hoare annotation was computed. [2019-11-28 20:22:39,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:22:39 BoogieIcfgContainer [2019-11-28 20:22:39,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:22:39,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:22:39,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:22:39,927 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:22:39,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:22:35" (3/4) ... [2019-11-28 20:22:39,934 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:22:39,944 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-28 20:22:39,944 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-28 20:22:39,951 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 20:22:39,951 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:22:39,997 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:22:39,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:22:40,000 INFO L168 Benchmark]: Toolchain (without parser) took 4766.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -200.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:40,001 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:40,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.43 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.09 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:22:40,002 INFO L168 Benchmark]: Boogie Preprocessor took 76.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,003 INFO L168 Benchmark]: RCFGBuilder took 319.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,004 INFO L168 Benchmark]: TraceAbstraction took 4040.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -61.3 MB). Peak memory consumption was 312.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,004 INFO L168 Benchmark]: Witness Printer took 71.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:22:40,008 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 225.43 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.09 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 319.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4040.93 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -61.3 MB). Peak memory consumption was 312.1 MB. Max. memory is 11.5 GB. * Witness Printer took 71.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 10 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 307 SDtfs, 289 SDslu, 944 SDs, 0 SdLazy, 605 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 63 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 103 PreInvPairs, 115 NumberOfFragments, 70 HoareAnnotationTreeSize, 103 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 148 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 36147 SizeOfPredicates, 5 NumberOfNonLiveVariables, 122 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 293/299 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...