./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-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/NestedRecursion_2c_true-no-overflow_true-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 14df269faa4a77275028af94d8141ab36c184cf5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:26,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:34:26,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:34:27,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:34:27,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:34:27,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:34:27,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:34:27,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:34:27,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:34:27,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:34:27,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:34:27,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:34:27,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:34:27,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:34:27,023 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:34:27,024 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:34:27,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:34:27,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:34:27,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:34:27,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:34:27,040 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:34:27,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:34:27,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:34:27,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:34:27,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:34:27,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:34:27,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:34:27,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:34:27,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:34:27,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:34:27,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:34:27,058 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:34:27,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:34:27,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:34:27,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:34:27,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:34:27,061 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:27,092 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:34:27,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:34:27,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:34:27,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:34:27,096 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:34:27,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:34:27,096 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:34:27,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:34:27,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:34:27,097 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 20:34:27,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:34:27,097 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 20:34:27,097 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 20:34:27,097 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 20:34:27,098 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:34:27,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 20:34:27,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:34:27,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:34:27,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:34:27,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:34:27,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:34:27,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:34:27,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:34:27,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 20:34:27,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:34:27,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:34:27,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 20:34:27,100 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 -> 14df269faa4a77275028af94d8141ab36c184cf5 [2019-01-01 20:34:27,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:34:27,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:34:27,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:34:27,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:34:27,192 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:34:27,193 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:27,270 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e586fa7f0/5475ffa7d3a44ff485c2d6eedf5aa35e/FLAGeda50660e [2019-01-01 20:34:27,723 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:34:27,724 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:27,730 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e586fa7f0/5475ffa7d3a44ff485c2d6eedf5aa35e/FLAGeda50660e [2019-01-01 20:34:28,076 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e586fa7f0/5475ffa7d3a44ff485c2d6eedf5aa35e [2019-01-01 20:34:28,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:34:28,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 20:34:28,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:28,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:34:28,089 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:34:28,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598afbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28, skipping insertion in model container [2019-01-01 20:34:28,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:34:28" (1/1) ... [2019-01-01 20:34:28,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:34:28,124 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:34:28,363 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:28,369 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:34:28,390 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:34:28,407 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:34:28,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28 WrapperNode [2019-01-01 20:34:28,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:34:28,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:28,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 20:34:28,409 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 20:34:28,417 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:28" (1/1) ... [2019-01-01 20:34:28,422 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:28" (1/1) ... [2019-01-01 20:34:28,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 20:34:28,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:34:28,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:34:28,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:34:28,448 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:28" (1/1) ... [2019-01-01 20:34:28,448 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:28" (1/1) ... [2019-01-01 20:34:28,449 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:28" (1/1) ... [2019-01-01 20:34:28,449 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:28" (1/1) ... [2019-01-01 20:34:28,451 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:28" (1/1) ... [2019-01-01 20:34:28,454 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:28" (1/1) ... [2019-01-01 20:34:28,455 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:28" (1/1) ... [2019-01-01 20:34:28,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:34:28,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:34:28,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:34:28,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:34:28,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (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:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 20:34:28,590 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 20:34:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:34:28,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:34:28,883 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:34:28,884 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 20:34:28,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:28 BoogieIcfgContainer [2019-01-01 20:34:28,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:34:28,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:34:28,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:34:28,891 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:34:28,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:34:28" (1/3) ... [2019-01-01 20:34:28,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6b2fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:28, skipping insertion in model container [2019-01-01 20:34:28,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:34:28" (2/3) ... [2019-01-01 20:34:28,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6b2fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:34:28, skipping insertion in model container [2019-01-01 20:34:28,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:34:28" (3/3) ... [2019-01-01 20:34:28,895 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-01 20:34:28,920 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:34:28,931 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-01 20:34:28,951 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-01 20:34:29,016 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:34:29,017 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:34:29,017 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 20:34:29,017 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:34:29,017 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:34:29,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:34:29,018 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:34:29,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:34:29,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:34:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-01-01 20:34:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 20:34:29,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:29,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 20:34:29,050 INFO L423 AbstractCegarLoop]: === Iteration 1 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1454635077, now seen corresponding path program 1 times [2019-01-01 20:34:29,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:29,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:29,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:29,304 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:29,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:29,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:29,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:29,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:29,327 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-01-01 20:34:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:29,507 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-01-01 20:34:29,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:29,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-01 20:34:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:29,519 INFO L225 Difference]: With dead ends: 41 [2019-01-01 20:34:29,520 INFO L226 Difference]: Without dead ends: 36 [2019-01-01 20:34:29,523 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:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-01 20:34:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-01-01 20:34:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 20:34:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-01 20:34:29,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 6 [2019-01-01 20:34:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:29,573 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-01 20:34:29,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-01-01 20:34:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 20:34:29,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:29,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:29,575 INFO L423 AbstractCegarLoop]: === Iteration 2 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2144014465, now seen corresponding path program 1 times [2019-01-01 20:34:29,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:29,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:29,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:29,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:29,664 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:29,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:29,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:29,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:29,668 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-01-01 20:34:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,045 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-01-01 20:34:30,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:34:30,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-01 20:34:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,048 INFO L225 Difference]: With dead ends: 50 [2019-01-01 20:34:30,048 INFO L226 Difference]: Without dead ends: 46 [2019-01-01 20:34:30,050 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:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-01 20:34:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2019-01-01 20:34:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 20:34:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-01 20:34:30,063 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 7 [2019-01-01 20:34:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,064 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-01 20:34:30,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-01-01 20:34:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 20:34:30,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:30,066 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:30,066 INFO L423 AbstractCegarLoop]: === Iteration 3 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:30,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:30,067 INFO L82 PathProgramCache]: Analyzing trace with hash -736378463, now seen corresponding path program 1 times [2019-01-01 20:34:30,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:30,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:30,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:30,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:30,232 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:30,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:30,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:30,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:34:30,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:30,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:30,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:30,318 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 7 states. [2019-01-01 20:34:30,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,658 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2019-01-01 20:34:30,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:34:30,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-01 20:34:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,661 INFO L225 Difference]: With dead ends: 63 [2019-01-01 20:34:30,661 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 20:34:30,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 20:34:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-01 20:34:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 20:34:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2019-01-01 20:34:30,678 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 12 [2019-01-01 20:34:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,678 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2019-01-01 20:34:30,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2019-01-01 20:34:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-01 20:34:30,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:30,680 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:30,681 INFO L423 AbstractCegarLoop]: === Iteration 4 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1009328462, now seen corresponding path program 1 times [2019-01-01 20:34:30,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:30,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,736 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:30,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:30,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:34:30,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:34:30,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:34:30,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:34:30,739 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 3 states. [2019-01-01 20:34:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,761 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-01-01 20:34:30,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:34:30,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-01 20:34:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,764 INFO L225 Difference]: With dead ends: 52 [2019-01-01 20:34:30,764 INFO L226 Difference]: Without dead ends: 51 [2019-01-01 20:34:30,765 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:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-01 20:34:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-01 20:34:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-01 20:34:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-01-01 20:34:30,777 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 14 [2019-01-01 20:34:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,778 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-01-01 20:34:30,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:34:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-01-01 20:34:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 20:34:30,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:30,779 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:30,781 INFO L423 AbstractCegarLoop]: === Iteration 5 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411294, now seen corresponding path program 1 times [2019-01-01 20:34:30,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:30,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:30,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:30,851 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:30,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:30,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:34:30,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:34:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:34:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:30,853 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 4 states. [2019-01-01 20:34:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:30,908 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2019-01-01 20:34:30,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 20:34:30,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-01 20:34:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:30,911 INFO L225 Difference]: With dead ends: 77 [2019-01-01 20:34:30,912 INFO L226 Difference]: Without dead ends: 76 [2019-01-01 20:34:30,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:34:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-01 20:34:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-01-01 20:34:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 20:34:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-01-01 20:34:30,927 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 15 [2019-01-01 20:34:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:30,928 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-01-01 20:34:30,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:34:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-01-01 20:34:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 20:34:30,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:30,930 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-01 20:34:30,931 INFO L423 AbstractCegarLoop]: === Iteration 6 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash -231947135, now seen corresponding path program 2 times [2019-01-01 20:34:30,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:30,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:30,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:31,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:31,112 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:31,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:31,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:31,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:31,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:31,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:31,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:34:31,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:34:31,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:34:31,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:31,215 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 9 states. [2019-01-01 20:34:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:31,813 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-01-01 20:34:31,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:34:31,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-01 20:34:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:31,817 INFO L225 Difference]: With dead ends: 90 [2019-01-01 20:34:31,822 INFO L226 Difference]: Without dead ends: 89 [2019-01-01 20:34:31,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-01 20:34:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-01 20:34:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-01 20:34:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-01-01 20:34:31,851 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 17 [2019-01-01 20:34:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:31,851 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-01-01 20:34:31,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:34:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-01-01 20:34:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-01 20:34:31,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:31,855 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:31,855 INFO L423 AbstractCegarLoop]: === Iteration 7 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:31,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash -855233152, now seen corresponding path program 1 times [2019-01-01 20:34:31,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:31,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:31,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:31,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:31,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:31,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:34:31,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:31,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:31,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:31,995 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 6 states. [2019-01-01 20:34:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:32,275 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2019-01-01 20:34:32,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:34:32,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-01 20:34:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:32,277 INFO L225 Difference]: With dead ends: 117 [2019-01-01 20:34:32,277 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 20:34:32,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:32,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 20:34:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-01-01 20:34:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 20:34:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2019-01-01 20:34:32,311 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 19 [2019-01-01 20:34:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:32,317 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2019-01-01 20:34:32,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2019-01-01 20:34:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 20:34:32,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:32,319 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:32,320 INFO L423 AbstractCegarLoop]: === Iteration 8 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash -742423898, now seen corresponding path program 1 times [2019-01-01 20:34:32,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:32,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:32,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:32,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:32,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:32,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:32,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:34:32,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:34:32,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:34:32,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:34:32,412 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 6 states. [2019-01-01 20:34:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:32,675 INFO L93 Difference]: Finished difference Result 135 states and 174 transitions. [2019-01-01 20:34:32,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:34:32,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-01 20:34:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:32,678 INFO L225 Difference]: With dead ends: 135 [2019-01-01 20:34:32,678 INFO L226 Difference]: Without dead ends: 134 [2019-01-01 20:34:32,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-01 20:34:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2019-01-01 20:34:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 20:34:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2019-01-01 20:34:32,699 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 20 [2019-01-01 20:34:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:32,700 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2019-01-01 20:34:32,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:34:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2019-01-01 20:34:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-01 20:34:32,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:32,702 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-01 20:34:32,703 INFO L423 AbstractCegarLoop]: === Iteration 9 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash -559247967, now seen corresponding path program 3 times [2019-01-01 20:34:32,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:32,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:32,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:32,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:32,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:32,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:34:32,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:32,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:32,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:32,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:34:32,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:34:32,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:34:32,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:32,946 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand 11 states. [2019-01-01 20:34:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:33,272 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2019-01-01 20:34:33,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 20:34:33,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-01 20:34:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:33,275 INFO L225 Difference]: With dead ends: 150 [2019-01-01 20:34:33,275 INFO L226 Difference]: Without dead ends: 149 [2019-01-01 20:34:33,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:34:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-01 20:34:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2019-01-01 20:34:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-01 20:34:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2019-01-01 20:34:33,297 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 22 [2019-01-01 20:34:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:33,297 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2019-01-01 20:34:33,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:34:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2019-01-01 20:34:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 20:34:33,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:33,300 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:33,301 INFO L423 AbstractCegarLoop]: === Iteration 10 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:33,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:33,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1606295908, now seen corresponding path program 2 times [2019-01-01 20:34:33,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:33,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:33,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:33,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:33,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:33,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:33,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:33,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 20:34:33,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:34:33,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:34:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:34:33,482 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand 8 states. [2019-01-01 20:34:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:33,779 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2019-01-01 20:34:33,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:34:33,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-01-01 20:34:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:33,783 INFO L225 Difference]: With dead ends: 174 [2019-01-01 20:34:33,783 INFO L226 Difference]: Without dead ends: 173 [2019-01-01 20:34:33,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-01-01 20:34:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-01 20:34:33,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2019-01-01 20:34:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-01 20:34:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 206 transitions. [2019-01-01 20:34:33,804 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 206 transitions. Word has length 25 [2019-01-01 20:34:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:33,804 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 206 transitions. [2019-01-01 20:34:33,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:34:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 206 transitions. [2019-01-01 20:34:33,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-01 20:34:33,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:33,807 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-01 20:34:33,808 INFO L423 AbstractCegarLoop]: === Iteration 11 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:33,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1828550785, now seen corresponding path program 4 times [2019-01-01 20:34:33,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:33,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:33,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:33,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:34:34,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:34,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:34,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:34,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:34,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:34,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-01 20:34:34,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:34,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-01-01 20:34:34,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 20:34:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 20:34:34,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:34:34,201 INFO L87 Difference]: Start difference. First operand 161 states and 206 transitions. Second operand 14 states. [2019-01-01 20:34:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:34,409 INFO L93 Difference]: Finished difference Result 165 states and 215 transitions. [2019-01-01 20:34:34,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:34:34,412 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-01 20:34:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:34,414 INFO L225 Difference]: With dead ends: 165 [2019-01-01 20:34:34,415 INFO L226 Difference]: Without dead ends: 164 [2019-01-01 20:34:34,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-01 20:34:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-01 20:34:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-01 20:34:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 205 transitions. [2019-01-01 20:34:34,433 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 205 transitions. Word has length 27 [2019-01-01 20:34:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:34,434 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 205 transitions. [2019-01-01 20:34:34,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 20:34:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 205 transitions. [2019-01-01 20:34:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 20:34:34,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:34,437 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:34,438 INFO L423 AbstractCegarLoop]: === Iteration 12 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:34,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:34,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1103662182, now seen corresponding path program 3 times [2019-01-01 20:34:34,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:34,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:34,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:34,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:34,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:34,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:34,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:34,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 20:34:34,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:34,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:34,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:34,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-01 20:34:34,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 20:34:34,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 20:34:34,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-01 20:34:34,720 INFO L87 Difference]: Start difference. First operand 161 states and 205 transitions. Second operand 10 states. [2019-01-01 20:34:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:35,205 INFO L93 Difference]: Finished difference Result 194 states and 248 transitions. [2019-01-01 20:34:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:34:35,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-01-01 20:34:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:35,208 INFO L225 Difference]: With dead ends: 194 [2019-01-01 20:34:35,208 INFO L226 Difference]: Without dead ends: 193 [2019-01-01 20:34:35,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-01 20:34:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-01 20:34:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-01 20:34:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2019-01-01 20:34:35,226 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 30 [2019-01-01 20:34:35,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:35,226 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2019-01-01 20:34:35,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 20:34:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2019-01-01 20:34:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 20:34:35,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:35,229 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:35,231 INFO L423 AbstractCegarLoop]: === Iteration 13 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:35,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:35,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1629013057, now seen corresponding path program 1 times [2019-01-01 20:34:35,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:35,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:35,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:35,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:35,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:35,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:35,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:35,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:35,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:35,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:35,326 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand 5 states. [2019-01-01 20:34:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:35,500 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2019-01-01 20:34:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:34:35,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-01 20:34:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:35,505 INFO L225 Difference]: With dead ends: 179 [2019-01-01 20:34:35,506 INFO L226 Difference]: Without dead ends: 178 [2019-01-01 20:34:35,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-01 20:34:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-01-01 20:34:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-01 20:34:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2019-01-01 20:34:35,525 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 31 [2019-01-01 20:34:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:35,526 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2019-01-01 20:34:35,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2019-01-01 20:34:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 20:34:35,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:35,532 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:35,532 INFO L423 AbstractCegarLoop]: === Iteration 14 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:35,533 INFO L82 PathProgramCache]: Analyzing trace with hash 857271516, now seen corresponding path program 4 times [2019-01-01 20:34:35,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:35,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:35,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:35,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:35,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:34:36,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:36,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:36,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:36,254 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:36,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:36,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 20:34:36,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:34:36,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2019-01-01 20:34:36,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 20:34:36,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 20:34:36,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-01-01 20:34:36,341 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand 16 states. [2019-01-01 20:34:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:36,742 INFO L93 Difference]: Finished difference Result 239 states and 303 transitions. [2019-01-01 20:34:36,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 20:34:36,743 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-01-01 20:34:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:36,745 INFO L225 Difference]: With dead ends: 239 [2019-01-01 20:34:36,746 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 20:34:36,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2019-01-01 20:34:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 20:34:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2019-01-01 20:34:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 20:34:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2019-01-01 20:34:36,762 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 35 [2019-01-01 20:34:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:36,762 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2019-01-01 20:34:36,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 20:34:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2019-01-01 20:34:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 20:34:36,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:36,765 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:36,766 INFO L423 AbstractCegarLoop]: === Iteration 15 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -490250333, now seen corresponding path program 1 times [2019-01-01 20:34:36,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:36,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:36,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-01 20:34:37,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:37,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:34:37,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:34:37,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:34:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:34:37,011 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand 5 states. [2019-01-01 20:34:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:37,734 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2019-01-01 20:34:37,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 20:34:37,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-01 20:34:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:37,738 INFO L225 Difference]: With dead ends: 106 [2019-01-01 20:34:37,738 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 20:34:37,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 20:34:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-01 20:34:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 20:34:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2019-01-01 20:34:37,750 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 35 [2019-01-01 20:34:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:37,750 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2019-01-01 20:34:37,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:34:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2019-01-01 20:34:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 20:34:37,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:37,755 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:37,755 INFO L423 AbstractCegarLoop]: === Iteration 16 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:37,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1982108899, now seen corresponding path program 1 times [2019-01-01 20:34:37,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:37,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:37,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:37,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:34:37,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 20:34:37,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:34:37,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:34:37,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:34:37,938 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand 7 states. [2019-01-01 20:34:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:38,495 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2019-01-01 20:34:38,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 20:34:38,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-01 20:34:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:38,498 INFO L225 Difference]: With dead ends: 124 [2019-01-01 20:34:38,499 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 20:34:38,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 20:34:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-01-01 20:34:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-01 20:34:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2019-01-01 20:34:38,509 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 36 [2019-01-01 20:34:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:38,509 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2019-01-01 20:34:38,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:34:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2019-01-01 20:34:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 20:34:38,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:38,511 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:38,511 INFO L423 AbstractCegarLoop]: === Iteration 17 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash -732976513, now seen corresponding path program 2 times [2019-01-01 20:34:38,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:38,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:38,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:34:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:38,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:38,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:38,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:34:38,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:34:38,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:38,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:38,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:38,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 20:34:38,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 20:34:38,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 20:34:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 20:34:38,802 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 9 states. [2019-01-01 20:34:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:39,219 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2019-01-01 20:34:39,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 20:34:39,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-01-01 20:34:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:39,228 INFO L225 Difference]: With dead ends: 140 [2019-01-01 20:34:39,228 INFO L226 Difference]: Without dead ends: 139 [2019-01-01 20:34:39,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-01 20:34:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-01 20:34:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-01 20:34:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2019-01-01 20:34:39,242 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 41 [2019-01-01 20:34:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:39,242 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2019-01-01 20:34:39,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 20:34:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2019-01-01 20:34:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-01 20:34:39,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:39,247 INFO L402 BasicCegarLoop]: trace histogram [7, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:39,247 INFO L423 AbstractCegarLoop]: === Iteration 18 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2029893219, now seen corresponding path program 3 times [2019-01-01 20:34:39,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:39,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:39,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:39,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:39,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:39,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:34:39,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-01 20:34:39,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:39,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:39,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:39,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 20:34:39,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 20:34:39,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 20:34:39,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-01 20:34:39,479 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand 11 states. [2019-01-01 20:34:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:39,927 INFO L93 Difference]: Finished difference Result 158 states and 183 transitions. [2019-01-01 20:34:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 20:34:39,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-01-01 20:34:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:39,929 INFO L225 Difference]: With dead ends: 158 [2019-01-01 20:34:39,930 INFO L226 Difference]: Without dead ends: 157 [2019-01-01 20:34:39,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-01-01 20:34:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-01 20:34:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-01 20:34:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-01 20:34:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2019-01-01 20:34:39,944 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 46 [2019-01-01 20:34:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:39,944 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2019-01-01 20:34:39,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 20:34:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2019-01-01 20:34:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 20:34:39,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:39,948 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:39,948 INFO L423 AbstractCegarLoop]: === Iteration 19 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:39,948 INFO L82 PathProgramCache]: Analyzing trace with hash -613451521, now seen corresponding path program 4 times [2019-01-01 20:34:39,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:39,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:39,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:39,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:40,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:40,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:40,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:34:40,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:34:40,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:40,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:40,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:34:40,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-01 20:34:40,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 20:34:40,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 20:34:40,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:34:40,193 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand 13 states. [2019-01-01 20:34:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:40,805 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2019-01-01 20:34:40,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-01 20:34:40,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-01-01 20:34:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:40,809 INFO L225 Difference]: With dead ends: 176 [2019-01-01 20:34:40,809 INFO L226 Difference]: Without dead ends: 175 [2019-01-01 20:34:40,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 20:34:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-01 20:34:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-01 20:34:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-01 20:34:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2019-01-01 20:34:40,826 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 51 [2019-01-01 20:34:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:40,827 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2019-01-01 20:34:40,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 20:34:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2019-01-01 20:34:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 20:34:40,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:34:40,828 INFO L402 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 20:34:40,829 INFO L423 AbstractCegarLoop]: === Iteration 20 === [gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 20:34:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:34:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1845164003, now seen corresponding path program 5 times [2019-01-01 20:34:40,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:34:40,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:34:40,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:40,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:34:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:34:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:34:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 20:34:41,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:34:41,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:34:41,364 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 20:34:41,417 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-01 20:34:41,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:34:41,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:34:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-01 20:34:41,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 20:34:41,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2019-01-01 20:34:41,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-01 20:34:41,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-01 20:34:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-01 20:34:41,682 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 20 states. [2019-01-01 20:34:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:34:41,801 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2019-01-01 20:34:41,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:34:41,803 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-01-01 20:34:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:34:41,803 INFO L225 Difference]: With dead ends: 215 [2019-01-01 20:34:41,803 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:34:41,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2019-01-01 20:34:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:34:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:34:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:34:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:34:41,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2019-01-01 20:34:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:34:41,809 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:34:41,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-01 20:34:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:34:41,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:34:41,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 20:34:41,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:41,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:41,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:41,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:41,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:41,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-01 20:34:42,283 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 20 [2019-01-01 20:34:42,507 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 17 [2019-01-01 20:34:42,510 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2019-01-01 20:34:42,511 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,511 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,511 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,511 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,512 INFO L444 ceAbstractionStarter]: At program point L15-2(line 15) the Hoare annotation is: (and (or (and (<= 0 g_~x) (<= g_~x 2147483647) (not (= 0 g_~x))) (< |g_#in~x| 0) (< 2147483647 |g_#in~x|)) (not (= |g_#in~x| 0))) [2019-01-01 20:34:42,512 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. [2019-01-01 20:34:42,512 INFO L448 ceAbstractionStarter]: For program point L15-3(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,512 INFO L448 ceAbstractionStarter]: For program point L15-4(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,512 INFO L448 ceAbstractionStarter]: For program point L15-5(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,513 INFO L444 ceAbstractionStarter]: At program point L15-6(line 15) the Hoare annotation is: (and (not (= |g_#in~x| 0)) (or (and (<= 0 g_~x) (= 1 |g_#t~ret0|) (<= g_~x 2147483647) (not (= 0 g_~x))) (< |g_#in~x| 0) (< 2147483647 |g_#in~x|))) [2019-01-01 20:34:42,513 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2019-01-01 20:34:42,513 INFO L448 ceAbstractionStarter]: For program point L15-7(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,513 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2019-01-01 20:34:42,513 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,513 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-01 20:34:42,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 20:34:42,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 20:34:42,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 20:34:42,514 INFO L444 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 ULTIMATE.start_main_~x~0)) [2019-01-01 20:34:42,514 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 20:34:42,514 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-01 20:34:42,514 INFO L444 ceAbstractionStarter]: At program point L18(lines 18 22) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-01-01 20:34:42,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:34:42 BoogieIcfgContainer [2019-01-01 20:34:42,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:34:42,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:34:42,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:34:42,527 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:34:42,527 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:28" (3/4) ... [2019-01-01 20:34:42,530 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:34:42,536 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-01 20:34:42,541 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 20:34:42,541 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 20:34:42,586 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:34:42,587 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:34:42,588 INFO L168 Benchmark]: Toolchain (without parser) took 14505.37 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:42,590 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:42,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.16 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:42,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.63 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:42,592 INFO L168 Benchmark]: Boogie Preprocessor took 16.18 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:34:42,593 INFO L168 Benchmark]: RCFGBuilder took 428.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:42,594 INFO L168 Benchmark]: TraceAbstraction took 13638.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.4 MB). Peak memory consumption was 131.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:42,595 INFO L168 Benchmark]: Witness Printer took 60.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-01-01 20:34:42,600 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.16 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 30.63 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.18 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 428.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13638.59 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.4 MB). Peak memory consumption was 131.4 MB. Max. memory is 11.5 GB. * Witness Printer took 60.60 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: x <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 4 error locations. SAFE Result, 13.5s OverallTime, 20 OverallIterations, 9 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 379 SDtfs, 673 SDslu, 1513 SDs, 0 SdLazy, 1575 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 626 GetRequests, 380 SyntacticMatches, 4 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=12, 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.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 89 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 170 PreInvPairs, 188 NumberOfFragments, 64 HoareAnnotationTreeSize, 170 FomulaSimplifications, 631 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 401 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 907 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 76754 SizeOfPredicates, 30 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 934/1271 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...