./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/bitvector-loops/diamond_false-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/bitvector-loops/diamond_false-unreach-call2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:08:44,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:08:44,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:08:45,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:08:45,005 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:08:45,006 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:08:45,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:08:45,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:08:45,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:08:45,013 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:08:45,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:08:45,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:08:45,016 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:08:45,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:08:45,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:08:45,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:08:45,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:08:45,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:08:45,025 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:08:45,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:08:45,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:08:45,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:08:45,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:08:45,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:08:45,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:08:45,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:08:45,035 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:08:45,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:08:45,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:08:45,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:08:45,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:08:45,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:08:45,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:08:45,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:08:45,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:08:45,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:08:45,043 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:08:45,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:08:45,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:08:45,060 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:08:45,061 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:08:45,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:08:45,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:08:45,062 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:08:45,062 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:08:45,062 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:08:45,063 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:08:45,063 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:08:45,063 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:08:45,063 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:08:45,063 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:08:45,063 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:08:45,065 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:08:45,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:08:45,065 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:08:45,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:08:45,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:08:45,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:08:45,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:08:45,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:08:45,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:08:45,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:08:45,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:08:45,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:08:45,068 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:08:45,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:08:45,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:08:45,069 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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c [2018-11-28 16:08:45,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:08:45,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:08:45,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:08:45,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:08:45,148 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:08:45,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-28 16:08:45,218 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3a7d51e/6ac31590d3f34791889d88a526e4ecdf/FLAG7964eecfb [2018-11-28 16:08:45,677 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:08:45,678 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-28 16:08:45,686 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3a7d51e/6ac31590d3f34791889d88a526e4ecdf/FLAG7964eecfb [2018-11-28 16:08:46,028 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c3a7d51e/6ac31590d3f34791889d88a526e4ecdf [2018-11-28 16:08:46,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:08:46,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:08:46,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:08:46,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:08:46,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:08:46,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e68a996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46, skipping insertion in model container [2018-11-28 16:08:46,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:08:46,074 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:08:46,276 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:08:46,283 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:08:46,308 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:08:46,329 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:08:46,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46 WrapperNode [2018-11-28 16:08:46,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:08:46,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:08:46,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:08:46,331 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:08:46,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:08:46,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:08:46,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:08:46,357 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:08:46,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (1/1) ... [2018-11-28 16:08:46,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:08:46,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:08:46,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:08:46,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:08:46,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (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 [2018-11-28 16:08:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:08:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:08:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:08:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:08:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:08:46,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:08:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 16:08:46,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 16:08:46,953 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:08:46,953 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:08:46,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:46 BoogieIcfgContainer [2018-11-28 16:08:46,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:08:46,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:08:46,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:08:46,960 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:08:46,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:08:46" (1/3) ... [2018-11-28 16:08:46,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437633ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:08:46, skipping insertion in model container [2018-11-28 16:08:46,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:08:46" (2/3) ... [2018-11-28 16:08:46,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437633ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:08:46, skipping insertion in model container [2018-11-28 16:08:46,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:46" (3/3) ... [2018-11-28 16:08:46,967 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call2.i [2018-11-28 16:08:46,986 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:08:46,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:08:47,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:08:47,044 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:08:47,045 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:08:47,045 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:08:47,045 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:08:47,046 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:08:47,046 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:08:47,046 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:08:47,046 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:08:47,046 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:08:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-28 16:08:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 16:08:47,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:47,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:47,079 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:47,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-11-28 16:08:47,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:47,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:47,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:47,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:47,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:47,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 16:08:47,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 16:08:47,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 16:08:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 16:08:47,212 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-28 16:08:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:47,234 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-28 16:08:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 16:08:47,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 16:08:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:47,247 INFO L225 Difference]: With dead ends: 38 [2018-11-28 16:08:47,247 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 16:08:47,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 16:08:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 16:08:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 16:08:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 16:08:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-11-28 16:08:47,295 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-11-28 16:08:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:47,296 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-28 16:08:47,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 16:08:47,296 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-28 16:08:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 16:08:47,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:47,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:47,297 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:47,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:47,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-11-28 16:08:47,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:47,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:47,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:47,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:47,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:47,610 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-11-28 16:08:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:47,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:47,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:08:47,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:08:47,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:08:47,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:47,625 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-11-28 16:08:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:47,822 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-28 16:08:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:08:47,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 16:08:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:47,826 INFO L225 Difference]: With dead ends: 28 [2018-11-28 16:08:47,826 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 16:08:47,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 16:08:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-28 16:08:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 16:08:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-28 16:08:47,836 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-28 16:08:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:47,836 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-28 16:08:47,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:08:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-28 16:08:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:08:47,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:47,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:47,839 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:47,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-11-28 16:08:47,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:47,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:48,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:48,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:08:48,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:08:48,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:08:48,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:48,029 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-28 16:08:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:48,457 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-11-28 16:08:48,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:08:48,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:08:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:48,460 INFO L225 Difference]: With dead ends: 50 [2018-11-28 16:08:48,460 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 16:08:48,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 16:08:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-28 16:08:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 16:08:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-11-28 16:08:48,468 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-11-28 16:08:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:48,469 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-28 16:08:48,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:08:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-11-28 16:08:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:08:48,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:48,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:48,471 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:48,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-11-28 16:08:48,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:48,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:48,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:48,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:48,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:49,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 16:08:49,014 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 [2018-11-28 16:08:49,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:49,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 16:08:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:49,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 16:08:49,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-28 16:08:49,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 16:08:49,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 16:08:49,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-28 16:08:49,273 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-11-28 16:08:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:50,052 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-28 16:08:50,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 16:08:50,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-28 16:08:50,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:50,055 INFO L225 Difference]: With dead ends: 51 [2018-11-28 16:08:50,055 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 16:08:50,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-28 16:08:50,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 16:08:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-28 16:08:50,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 16:08:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-28 16:08:50,064 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-11-28 16:08:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:50,064 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-28 16:08:50,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 16:08:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-28 16:08:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:08:50,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:50,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:50,066 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:50,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-11-28 16:08:50,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:50,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:50,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:50,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:50,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:52,115 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-28 16:08:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:52,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:52,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:08:52,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:08:52,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:08:52,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 16:08:52,134 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-11-28 16:08:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:52,139 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-28 16:08:52,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:08:52,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:08:52,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:52,140 INFO L225 Difference]: With dead ends: 60 [2018-11-28 16:08:52,140 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 16:08:52,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 16:08:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 16:08:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 16:08:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 16:08:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-28 16:08:52,148 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-11-28 16:08:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:52,153 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-28 16:08:52,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:08:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-28 16:08:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:08:52,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:52,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:52,156 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:52,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:52,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-11-28 16:08:52,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:52,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:52,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:52,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:54,237 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-28 16:08:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:54,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:54,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:08:54,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:08:54,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:08:54,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 16:08:54,245 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-11-28 16:08:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:54,251 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-28 16:08:54,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:08:54,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:08:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:54,253 INFO L225 Difference]: With dead ends: 60 [2018-11-28 16:08:54,253 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 16:08:54,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 16:08:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 16:08:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 16:08:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 16:08:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-28 16:08:54,263 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-11-28 16:08:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:54,264 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-28 16:08:54,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:08:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-28 16:08:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:08:54,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:54,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:54,266 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:54,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-11-28 16:08:54,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:54,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:54,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:56,327 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-28 16:08:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:56,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:56,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:08:56,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:08:56,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:08:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 16:08:56,334 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-28 16:08:56,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:56,340 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-28 16:08:56,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:08:56,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:08:56,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:56,341 INFO L225 Difference]: With dead ends: 60 [2018-11-28 16:08:56,341 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 16:08:56,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 16:08:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 16:08:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 16:08:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 16:08:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-28 16:08:56,350 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-11-28 16:08:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:56,351 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-28 16:08:56,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:08:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-28 16:08:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:08:56,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:56,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:56,354 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:56,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:56,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-11-28 16:08:56,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:56,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:56,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:56,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:56,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:08:56,526 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-11-28 16:08:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:08:56,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:08:56,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:08:56,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:08:56,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:08:56,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:56,530 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-11-28 16:08:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:08:56,599 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-28 16:08:56,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:08:56,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:08:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:08:56,603 INFO L225 Difference]: With dead ends: 61 [2018-11-28 16:08:56,603 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 16:08:56,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:08:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 16:08:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-28 16:08:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 16:08:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-28 16:08:56,611 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-11-28 16:08:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:08:56,613 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-28 16:08:56,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:08:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-28 16:08:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:08:56,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:08:56,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:08:56,615 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:08:56,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:08:56,615 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-11-28 16:08:56,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:08:56,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:08:56,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:56,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:08:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:08:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 16:08:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 16:08:56,688 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 16:08:56,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:08:56 BoogieIcfgContainer [2018-11-28 16:08:56,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:08:56,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:08:56,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:08:56,724 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:08:56,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:08:46" (3/4) ... [2018-11-28 16:08:56,729 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 16:08:56,798 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:08:56,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:08:56,799 INFO L168 Benchmark]: Toolchain (without parser) took 10767.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.3 MB in the beginning and 953.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 136.1 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:56,800 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:08:56,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:56,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.29 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:08:56,802 INFO L168 Benchmark]: Boogie Preprocessor took 46.31 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:56,803 INFO L168 Benchmark]: RCFGBuilder took 551.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:56,803 INFO L168 Benchmark]: TraceAbstraction took 9767.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 959.8 MB in the end (delta: 153.3 MB). Peak memory consumption was 153.3 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:56,804 INFO L168 Benchmark]: Witness Printer took 75.08 ms. Allocated memory is still 1.2 GB. Free memory was 959.8 MB in the beginning and 953.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:08:56,808 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.29 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.31 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 551.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9767.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 959.8 MB in the end (delta: 153.3 MB). Peak memory consumption was 153.3 MB. Max. memory is 11.5 GB. * Witness Printer took 75.08 ms. Allocated memory is still 1.2 GB. Free memory was 959.8 MB in the beginning and 953.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 VAL [x=0, y=3] [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 VAL [x=2, y=3] [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 VAL [x=0, y=3] [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 VAL [x=2, y=3] [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 VAL [x=0, y=3] [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 VAL [x=2, y=3] [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 VAL [x=4294967294, y=3] [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 VAL [x=2, y=3] [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 VAL [x=4, y=3] [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 VAL [x=0, y=3] [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 VAL [x=4294967292, y=3] [L12] COND FALSE !(x < 99) VAL [x=4294967292, y=3] [L34] CALL __VERIFIER_assert((x % 2) == (y % 2)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. UNSAFE Result, 9.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 216 SDtfs, 20 SDslu, 146 SDs, 0 SdLazy, 363 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 17416 SizeOfPredicates, 1 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 5/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...