./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-loops/diamond_2-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-loops/diamond_2-1.c -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 7aeed2387a92d93d76a9218958b4bab5d23187f1 ..................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-loops/diamond_2-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 7aeed2387a92d93d76a9218958b4bab5d23187f1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-8bd4bc6 [2020-07-28 15:02:32,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 15:02:32,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 15:02:32,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 15:02:32,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 15:02:32,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 15:02:32,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 15:02:32,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 15:02:32,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 15:02:32,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 15:02:32,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 15:02:32,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 15:02:32,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 15:02:32,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 15:02:32,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 15:02:32,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 15:02:32,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 15:02:32,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 15:02:32,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 15:02:32,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 15:02:32,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 15:02:32,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 15:02:32,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 15:02:32,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 15:02:32,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 15:02:32,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 15:02:32,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 15:02:32,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 15:02:32,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 15:02:32,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 15:02:32,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 15:02:32,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 15:02:32,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 15:02:32,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 15:02:32,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 15:02:32,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 15:02:32,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 15:02:32,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 15:02:32,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 15:02:32,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 15:02:32,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 15:02:32,883 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 15:02:32,899 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 15:02:32,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 15:02:32,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 15:02:32,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 15:02:32,901 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 15:02:32,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 15:02:32,902 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 15:02:32,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 15:02:32,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 15:02:32,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 15:02:32,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 15:02:32,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 15:02:32,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 15:02:32,904 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 15:02:32,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 15:02:32,904 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 15:02:32,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 15:02:32,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 15:02:32,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 15:02:32,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 15:02:32,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 15:02:32,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 15:02:32,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 15:02:32,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 15:02:32,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 15:02:32,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 15:02:32,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 15:02:32,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 15:02:32,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 15:02:32,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 7aeed2387a92d93d76a9218958b4bab5d23187f1 [2020-07-28 15:02:33,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 15:02:33,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 15:02:33,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 15:02:33,260 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 15:02:33,260 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 15:02:33,261 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/diamond_2-1.c [2020-07-28 15:02:33,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e4c57d4/6fa01afc6f85496e8e5d7eb8f74f37c1/FLAG41eae6417 [2020-07-28 15:02:33,756 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 15:02:33,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/diamond_2-1.c [2020-07-28 15:02:33,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e4c57d4/6fa01afc6f85496e8e5d7eb8f74f37c1/FLAG41eae6417 [2020-07-28 15:02:34,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e4c57d4/6fa01afc6f85496e8e5d7eb8f74f37c1 [2020-07-28 15:02:34,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 15:02:34,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 15:02:34,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 15:02:34,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 15:02:34,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 15:02:34,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1d6c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34, skipping insertion in model container [2020-07-28 15:02:34,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 15:02:34,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 15:02:34,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 15:02:34,440 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 15:02:34,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 15:02:34,474 INFO L208 MainTranslator]: Completed translation [2020-07-28 15:02:34,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34 WrapperNode [2020-07-28 15:02:34,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 15:02:34,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 15:02:34,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 15:02:34,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 15:02:34,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 15:02:34,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 15:02:34,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 15:02:34,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 15:02:34,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (1/1) ... [2020-07-28 15:02:34,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 15:02:34,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 15:02:34,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 15:02:34,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 15:02:34,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (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 [2020-07-28 15:02:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 15:02:34,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 15:02:35,031 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 15:02:35,031 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 15:02:35,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 03:02:35 BoogieIcfgContainer [2020-07-28 15:02:35,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 15:02:35,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 15:02:35,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 15:02:35,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 15:02:35,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 03:02:34" (1/3) ... [2020-07-28 15:02:35,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b2724f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 03:02:35, skipping insertion in model container [2020-07-28 15:02:35,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:34" (2/3) ... [2020-07-28 15:02:35,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b2724f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 03:02:35, skipping insertion in model container [2020-07-28 15:02:35,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 03:02:35" (3/3) ... [2020-07-28 15:02:35,048 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-1.c [2020-07-28 15:02:35,061 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 15:02:35,071 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 15:02:35,088 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 15:02:35,117 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 15:02:35,117 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 15:02:35,118 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 15:02:35,118 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 15:02:35,118 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 15:02:35,118 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 15:02:35,119 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 15:02:35,119 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 15:02:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 15:02:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 15:02:35,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 15:02:35,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 15:02:35,144 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 15:02:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 15:02:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash 31771204, now seen corresponding path program 1 times [2020-07-28 15:02:35,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 15:02:35,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146043190] [2020-07-28 15:02:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 15:02:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:35,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {22#true} is VALID [2020-07-28 15:02:35,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 15:02:35,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#false} __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 15:02:35,316 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume 0 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 15:02:35,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 15:02:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:35,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146043190] [2020-07-28 15:02:35,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 15:02:35,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 15:02:35,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483938436] [2020-07-28 15:02:35,329 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 15:02:35,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 15:02:35,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 15:02:35,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:35,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 15:02:35,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 15:02:35,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 15:02:35,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 15:02:35,363 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 15:02:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:35,437 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2020-07-28 15:02:35,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 15:02:35,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 15:02:35,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 15:02:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 15:02:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-28 15:02:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 15:02:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-28 15:02:35,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2020-07-28 15:02:35,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:35,542 INFO L225 Difference]: With dead ends: 26 [2020-07-28 15:02:35,542 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 15:02:35,546 INFO L675 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 [2020-07-28 15:02:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 15:02:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 15:02:35,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 15:02:35,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:35,587 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:35,588 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:35,595 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-07-28 15:02:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 15:02:35,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:35,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:35,598 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:35,598 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:35,604 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-07-28 15:02:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 15:02:35,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:35,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:35,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 15:02:35,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 15:02:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 15:02:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-07-28 15:02:35,622 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2020-07-28 15:02:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 15:02:35,626 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-28 15:02:35,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 15:02:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 15:02:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 15:02:35,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 15:02:35,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 15:02:35,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 15:02:35,628 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 15:02:35,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 15:02:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash 29864580, now seen corresponding path program 1 times [2020-07-28 15:02:35,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 15:02:35,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002804869] [2020-07-28 15:02:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 15:02:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:35,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 15:02:35,730 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 15:02:35,741 INFO L168 Benchmark]: Toolchain (without parser) took 1577.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -97.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:35,742 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 15:02:35,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.56 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:35,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:35,748 INFO L168 Benchmark]: Boogie Preprocessor took 29.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 15:02:35,749 INFO L168 Benchmark]: RCFGBuilder took 427.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:35,751 INFO L168 Benchmark]: TraceAbstraction took 697.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:35,762 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 311.56 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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 103.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 427.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 697.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 15:02:37,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 15:02:37,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 15:02:37,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 15:02:37,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 15:02:37,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 15:02:37,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 15:02:37,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 15:02:37,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 15:02:37,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 15:02:37,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 15:02:37,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 15:02:37,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 15:02:37,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 15:02:37,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 15:02:37,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 15:02:37,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 15:02:37,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 15:02:37,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 15:02:37,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 15:02:37,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 15:02:37,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 15:02:37,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 15:02:37,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 15:02:37,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 15:02:37,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 15:02:37,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 15:02:37,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 15:02:37,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 15:02:37,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 15:02:37,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 15:02:37,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 15:02:37,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 15:02:37,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 15:02:37,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 15:02:37,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 15:02:37,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 15:02:37,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 15:02:37,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 15:02:37,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 15:02:37,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 15:02:37,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 15:02:37,826 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 15:02:37,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 15:02:37,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 15:02:37,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 15:02:37,833 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 15:02:37,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 15:02:37,834 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 15:02:37,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 15:02:37,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 15:02:37,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 15:02:37,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 15:02:37,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 15:02:37,839 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 15:02:37,840 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 15:02:37,840 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 15:02:37,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 15:02:37,841 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 15:02:37,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 15:02:37,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 15:02:37,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 15:02:37,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 15:02:37,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 15:02:37,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 15:02:37,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 15:02:37,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 15:02:37,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 15:02:37,844 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 15:02:37,844 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 15:02:37,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 15:02:37,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 15:02:37,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 15:02:37,845 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 7aeed2387a92d93d76a9218958b4bab5d23187f1 [2020-07-28 15:02:38,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 15:02:38,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 15:02:38,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 15:02:38,175 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 15:02:38,176 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 15:02:38,177 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/diamond_2-1.c [2020-07-28 15:02:38,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf93f2a59/3c19821896814b498498a7edc7e3499c/FLAG51d313e4e [2020-07-28 15:02:38,702 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 15:02:38,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/diamond_2-1.c [2020-07-28 15:02:38,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf93f2a59/3c19821896814b498498a7edc7e3499c/FLAG51d313e4e [2020-07-28 15:02:39,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf93f2a59/3c19821896814b498498a7edc7e3499c [2020-07-28 15:02:39,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 15:02:39,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 15:02:39,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 15:02:39,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 15:02:39,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 15:02:39,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644edd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39, skipping insertion in model container [2020-07-28 15:02:39,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 15:02:39,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 15:02:39,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 15:02:39,331 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 15:02:39,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 15:02:39,395 INFO L208 MainTranslator]: Completed translation [2020-07-28 15:02:39,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39 WrapperNode [2020-07-28 15:02:39,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 15:02:39,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 15:02:39,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 15:02:39,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 15:02:39,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 15:02:39,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 15:02:39,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 15:02:39,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 15:02:39,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (1/1) ... [2020-07-28 15:02:39,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 15:02:39,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 15:02:39,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 15:02:39,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 15:02:39,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (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 [2020-07-28 15:02:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 15:02:39,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 15:02:39,994 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 15:02:39,995 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 15:02:39,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 03:02:39 BoogieIcfgContainer [2020-07-28 15:02:39,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 15:02:40,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 15:02:40,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 15:02:40,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 15:02:40,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 03:02:39" (1/3) ... [2020-07-28 15:02:40,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfe75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 03:02:40, skipping insertion in model container [2020-07-28 15:02:40,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 03:02:39" (2/3) ... [2020-07-28 15:02:40,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfe75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 03:02:40, skipping insertion in model container [2020-07-28 15:02:40,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 03:02:39" (3/3) ... [2020-07-28 15:02:40,008 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-1.c [2020-07-28 15:02:40,019 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 15:02:40,027 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 15:02:40,043 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 15:02:40,090 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 15:02:40,091 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 15:02:40,091 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 15:02:40,091 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 15:02:40,091 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 15:02:40,092 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 15:02:40,093 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 15:02:40,094 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 15:02:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 15:02:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 15:02:40,119 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 15:02:40,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 15:02:40,120 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 15:02:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 15:02:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash 31771204, now seen corresponding path program 1 times [2020-07-28 15:02:40,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 15:02:40,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866895227] [2020-07-28 15:02:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 15:02:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:40,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 15:02:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:40,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 15:02:40,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {22#true} is VALID [2020-07-28 15:02:40,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 15:02:40,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 15:02:40,221 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume 0bv32 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 15:02:40,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 15:02:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:40,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 15:02:40,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 15:02:40,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume 0bv32 == __VERIFIER_assert_~cond; {23#false} is VALID [2020-07-28 15:02:40,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23#false} is VALID [2020-07-28 15:02:40,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 15:02:40,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {22#true} is VALID [2020-07-28 15:02:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:40,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866895227] [2020-07-28 15:02:40,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 15:02:40,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 15:02:40,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433013624] [2020-07-28 15:02:40,261 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 15:02:40,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 15:02:40,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 15:02:40,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:40,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 15:02:40,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 15:02:40,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 15:02:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 15:02:40,293 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 15:02:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:40,369 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2020-07-28 15:02:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 15:02:40,369 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 15:02:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 15:02:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 15:02:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-28 15:02:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 15:02:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-28 15:02:40,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2020-07-28 15:02:40,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:40,490 INFO L225 Difference]: With dead ends: 26 [2020-07-28 15:02:40,490 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 15:02:40,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 15:02:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 15:02:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 15:02:40,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 15:02:40,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:40,527 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:40,527 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:40,530 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-07-28 15:02:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 15:02:40,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:40,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:40,531 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:40,532 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 15:02:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:40,535 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-07-28 15:02:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 15:02:40,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:40,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:40,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 15:02:40,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 15:02:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 15:02:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-07-28 15:02:40,540 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2020-07-28 15:02:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 15:02:40,541 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-07-28 15:02:40,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 15:02:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-07-28 15:02:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 15:02:40,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 15:02:40,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 15:02:40,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 15:02:40,754 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 15:02:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 15:02:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash 29864580, now seen corresponding path program 1 times [2020-07-28 15:02:40,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 15:02:40,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892666284] [2020-07-28 15:02:40,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2020-07-28 15:02:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:40,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 15:02:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:40,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 15:02:40,833 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {133#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 15:02:40,834 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 99bv32); {129#false} is VALID [2020-07-28 15:02:40,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {129#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {129#false} is VALID [2020-07-28 15:02:40,835 INFO L280 TraceCheckUtils]: 3: Hoare triple {129#false} assume 0bv32 == __VERIFIER_assert_~cond; {129#false} is VALID [2020-07-28 15:02:40,835 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#false} assume !false; {129#false} is VALID [2020-07-28 15:02:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:40,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 15:02:40,854 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#false} assume !false; {129#false} is VALID [2020-07-28 15:02:40,854 INFO L280 TraceCheckUtils]: 3: Hoare triple {129#false} assume 0bv32 == __VERIFIER_assert_~cond; {129#false} is VALID [2020-07-28 15:02:40,854 INFO L280 TraceCheckUtils]: 2: Hoare triple {129#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {129#false} is VALID [2020-07-28 15:02:40,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#(bvult ULTIMATE.start_main_~x~0 (_ bv99 32))} assume !~bvult32(main_~x~0, 99bv32); {129#false} is VALID [2020-07-28 15:02:40,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {128#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {155#(bvult ULTIMATE.start_main_~x~0 (_ bv99 32))} is VALID [2020-07-28 15:02:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:40,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892666284] [2020-07-28 15:02:40,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 15:02:40,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-07-28 15:02:40,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161998786] [2020-07-28 15:02:40,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 15:02:40,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 15:02:40,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 15:02:40,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:40,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 15:02:40,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 15:02:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 15:02:40,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 15:02:40,880 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 4 states. [2020-07-28 15:02:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:41,207 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2020-07-28 15:02:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 15:02:41,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 15:02:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 15:02:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 15:02:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-28 15:02:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 15:02:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-28 15:02:41,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2020-07-28 15:02:41,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:41,305 INFO L225 Difference]: With dead ends: 23 [2020-07-28 15:02:41,306 INFO L226 Difference]: Without dead ends: 19 [2020-07-28 15:02:41,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 15:02:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-28 15:02:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-07-28 15:02:41,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 15:02:41,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 17 states. [2020-07-28 15:02:41,317 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 17 states. [2020-07-28 15:02:41,317 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 17 states. [2020-07-28 15:02:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:41,326 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-07-28 15:02:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-07-28 15:02:41,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:41,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:41,327 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states. [2020-07-28 15:02:41,327 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states. [2020-07-28 15:02:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:41,332 INFO L93 Difference]: Finished difference Result 19 states and 31 transitions. [2020-07-28 15:02:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-07-28 15:02:41,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:41,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:41,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 15:02:41,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 15:02:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 15:02:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2020-07-28 15:02:41,339 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 [2020-07-28 15:02:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 15:02:41,339 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-07-28 15:02:41,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 15:02:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2020-07-28 15:02:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 15:02:41,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 15:02:41,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 15:02:41,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 15:02:41,542 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 15:02:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 15:02:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1273519218, now seen corresponding path program 1 times [2020-07-28 15:02:41,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 15:02:41,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320891426] [2020-07-28 15:02:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 15:02:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:41,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 15:02:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:41,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 15:02:41,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {240#true} is VALID [2020-07-28 15:02:41,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} assume !!~bvult32(main_~x~0, 99bv32); {240#true} is VALID [2020-07-28 15:02:41,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {240#true} is VALID [2020-07-28 15:02:41,626 INFO L280 TraceCheckUtils]: 3: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 15:02:41,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 15:02:41,628 INFO L280 TraceCheckUtils]: 5: Hoare triple {240#true} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 15:02:41,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 15:02:41,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 15:02:41,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 15:02:41,635 INFO L280 TraceCheckUtils]: 9: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 15:02:41,635 INFO L280 TraceCheckUtils]: 10: Hoare triple {241#false} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 15:02:41,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {241#false} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 15:02:41,636 INFO L280 TraceCheckUtils]: 12: Hoare triple {241#false} assume !~bvult32(main_~x~0, 99bv32); {241#false} is VALID [2020-07-28 15:02:41,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {241#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {241#false} is VALID [2020-07-28 15:02:41,636 INFO L280 TraceCheckUtils]: 14: Hoare triple {241#false} assume 0bv32 == __VERIFIER_assert_~cond; {241#false} is VALID [2020-07-28 15:02:41,637 INFO L280 TraceCheckUtils]: 15: Hoare triple {241#false} assume !false; {241#false} is VALID [2020-07-28 15:02:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:41,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 15:02:41,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {241#false} assume !false; {241#false} is VALID [2020-07-28 15:02:41,670 INFO L280 TraceCheckUtils]: 14: Hoare triple {241#false} assume 0bv32 == __VERIFIER_assert_~cond; {241#false} is VALID [2020-07-28 15:02:41,670 INFO L280 TraceCheckUtils]: 13: Hoare triple {241#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {241#false} is VALID [2020-07-28 15:02:41,670 INFO L280 TraceCheckUtils]: 12: Hoare triple {241#false} assume !~bvult32(main_~x~0, 99bv32); {241#false} is VALID [2020-07-28 15:02:41,671 INFO L280 TraceCheckUtils]: 11: Hoare triple {241#false} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 15:02:41,671 INFO L280 TraceCheckUtils]: 10: Hoare triple {241#false} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 15:02:41,672 INFO L280 TraceCheckUtils]: 9: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {241#false} is VALID [2020-07-28 15:02:41,673 INFO L280 TraceCheckUtils]: 8: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 15:02:41,674 INFO L280 TraceCheckUtils]: 7: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 15:02:41,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 15:02:41,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {240#true} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {260#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32))))} is VALID [2020-07-28 15:02:41,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 15:02:41,677 INFO L280 TraceCheckUtils]: 3: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {240#true} is VALID [2020-07-28 15:02:41,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {240#true} is VALID [2020-07-28 15:02:41,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#true} assume !!~bvult32(main_~x~0, 99bv32); {240#true} is VALID [2020-07-28 15:02:41,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {240#true} is VALID [2020-07-28 15:02:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:41,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320891426] [2020-07-28 15:02:41,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 15:02:41,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-28 15:02:41,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115606644] [2020-07-28 15:02:41,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 15:02:41,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 15:02:41,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 15:02:41,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:41,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 15:02:41,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 15:02:41,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 15:02:41,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 15:02:41,726 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 3 states. [2020-07-28 15:02:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:41,929 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2020-07-28 15:02:41,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 15:02:41,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 15:02:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 15:02:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 15:02:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-28 15:02:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 15:02:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-28 15:02:41,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2020-07-28 15:02:42,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:42,077 INFO L225 Difference]: With dead ends: 47 [2020-07-28 15:02:42,078 INFO L226 Difference]: Without dead ends: 32 [2020-07-28 15:02:42,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 15:02:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-28 15:02:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-07-28 15:02:42,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 15:02:42,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 28 states. [2020-07-28 15:02:42,089 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 28 states. [2020-07-28 15:02:42,089 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 28 states. [2020-07-28 15:02:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:42,092 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-28 15:02:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-07-28 15:02:42,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:42,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:42,093 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 32 states. [2020-07-28 15:02:42,094 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 32 states. [2020-07-28 15:02:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:42,097 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-28 15:02:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2020-07-28 15:02:42,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:42,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:42,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 15:02:42,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 15:02:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 15:02:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-07-28 15:02:42,101 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2020-07-28 15:02:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 15:02:42,101 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-07-28 15:02:42,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 15:02:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-07-28 15:02:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 15:02:42,102 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 15:02:42,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 15:02:42,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 15:02:42,324 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 15:02:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 15:02:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash 38278222, now seen corresponding path program 1 times [2020-07-28 15:02:42,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 15:02:42,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265081984] [2020-07-28 15:02:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 15:02:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:42,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 15:02:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:42,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 15:02:42,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {481#true} is VALID [2020-07-28 15:02:42,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#true} assume !!~bvult32(main_~x~0, 99bv32); {481#true} is VALID [2020-07-28 15:02:42,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {481#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,424 INFO L280 TraceCheckUtils]: 3: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,425 INFO L280 TraceCheckUtils]: 4: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,426 INFO L280 TraceCheckUtils]: 6: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,427 INFO L280 TraceCheckUtils]: 7: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,428 INFO L280 TraceCheckUtils]: 8: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(4bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,428 INFO L280 TraceCheckUtils]: 9: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {482#false} is VALID [2020-07-28 15:02:42,429 INFO L280 TraceCheckUtils]: 10: Hoare triple {482#false} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {482#false} is VALID [2020-07-28 15:02:42,429 INFO L280 TraceCheckUtils]: 11: Hoare triple {482#false} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {482#false} is VALID [2020-07-28 15:02:42,429 INFO L280 TraceCheckUtils]: 12: Hoare triple {482#false} assume !~bvult32(main_~x~0, 99bv32); {482#false} is VALID [2020-07-28 15:02:42,430 INFO L280 TraceCheckUtils]: 13: Hoare triple {482#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {482#false} is VALID [2020-07-28 15:02:42,430 INFO L280 TraceCheckUtils]: 14: Hoare triple {482#false} assume 0bv32 == __VERIFIER_assert_~cond; {482#false} is VALID [2020-07-28 15:02:42,430 INFO L280 TraceCheckUtils]: 15: Hoare triple {482#false} assume !false; {482#false} is VALID [2020-07-28 15:02:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:42,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 15:02:42,452 INFO L280 TraceCheckUtils]: 15: Hoare triple {482#false} assume !false; {482#false} is VALID [2020-07-28 15:02:42,452 INFO L280 TraceCheckUtils]: 14: Hoare triple {482#false} assume 0bv32 == __VERIFIER_assert_~cond; {482#false} is VALID [2020-07-28 15:02:42,453 INFO L280 TraceCheckUtils]: 13: Hoare triple {482#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {482#false} is VALID [2020-07-28 15:02:42,453 INFO L280 TraceCheckUtils]: 12: Hoare triple {482#false} assume !~bvult32(main_~x~0, 99bv32); {482#false} is VALID [2020-07-28 15:02:42,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {482#false} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {482#false} is VALID [2020-07-28 15:02:42,454 INFO L280 TraceCheckUtils]: 10: Hoare triple {482#false} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {482#false} is VALID [2020-07-28 15:02:42,455 INFO L280 TraceCheckUtils]: 9: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {482#false} is VALID [2020-07-28 15:02:42,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(4bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,456 INFO L280 TraceCheckUtils]: 7: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 4bv32); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(main_~y~0, 2bv32));main_~x~0 := ~bvsub32(main_~x~0, 2bv32); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,459 INFO L280 TraceCheckUtils]: 3: Hoare triple {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {481#true} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {492#(= (_ bv0 32) (bvurem ULTIMATE.start_main_~y~0 (_ bv2 32)))} is VALID [2020-07-28 15:02:42,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#true} assume !!~bvult32(main_~x~0, 99bv32); {481#true} is VALID [2020-07-28 15:02:42,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {481#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {481#true} is VALID [2020-07-28 15:02:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:42,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265081984] [2020-07-28 15:02:42,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 15:02:42,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-28 15:02:42,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138521102] [2020-07-28 15:02:42,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 15:02:42,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 15:02:42,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 15:02:42,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:42,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 15:02:42,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 15:02:42,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 15:02:42,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 15:02:42,495 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2020-07-28 15:02:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:42,651 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2020-07-28 15:02:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 15:02:42,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 15:02:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 15:02:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 15:02:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-28 15:02:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 15:02:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-28 15:02:42,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2020-07-28 15:02:42,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:42,750 INFO L225 Difference]: With dead ends: 48 [2020-07-28 15:02:42,751 INFO L226 Difference]: Without dead ends: 33 [2020-07-28 15:02:42,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 15:02:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-28 15:02:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2020-07-28 15:02:42,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 15:02:42,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 29 states. [2020-07-28 15:02:42,764 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 29 states. [2020-07-28 15:02:42,764 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 29 states. [2020-07-28 15:02:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:42,767 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-28 15:02:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-28 15:02:42,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:42,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:42,768 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 33 states. [2020-07-28 15:02:42,768 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 33 states. [2020-07-28 15:02:42,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:42,770 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-28 15:02:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-07-28 15:02:42,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:42,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:42,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 15:02:42,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 15:02:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-28 15:02:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-28 15:02:42,773 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2020-07-28 15:02:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 15:02:42,774 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-28 15:02:42,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 15:02:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-28 15:02:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 15:02:42,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 15:02:42,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 15:02:42,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 15:02:42,987 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 15:02:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 15:02:42,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1974583796, now seen corresponding path program 1 times [2020-07-28 15:02:42,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 15:02:42,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636497868] [2020-07-28 15:02:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 15:02:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:43,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 15:02:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 15:02:43,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 15:02:43,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {726#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {731#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 15:02:43,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {731#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 99bv32); {731#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 15:02:43,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {731#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {738#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 15:02:43,249 INFO L280 TraceCheckUtils]: 3: Hoare triple {738#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {742#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2020-07-28 15:02:43,251 INFO L280 TraceCheckUtils]: 4: Hoare triple {742#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {746#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2020-07-28 15:02:43,252 INFO L280 TraceCheckUtils]: 5: Hoare triple {746#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967291 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {750#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2020-07-28 15:02:43,253 INFO L280 TraceCheckUtils]: 6: Hoare triple {750#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967289 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {754#(= (_ bv9 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 15:02:43,254 INFO L280 TraceCheckUtils]: 7: Hoare triple {754#(= (_ bv9 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {758#(= (_ bv11 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 15:02:43,254 INFO L280 TraceCheckUtils]: 8: Hoare triple {758#(= (_ bv11 32) ULTIMATE.start_main_~x~0)} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {762#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2020-07-28 15:02:43,255 INFO L280 TraceCheckUtils]: 9: Hoare triple {762#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967283 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {766#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2020-07-28 15:02:43,256 INFO L280 TraceCheckUtils]: 10: Hoare triple {766#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967281 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {770#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2020-07-28 15:02:43,257 INFO L280 TraceCheckUtils]: 11: Hoare triple {770#(= (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967279 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {774#(= (_ bv19 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 15:02:43,257 INFO L280 TraceCheckUtils]: 12: Hoare triple {774#(= (_ bv19 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 99bv32); {727#false} is VALID [2020-07-28 15:02:43,258 INFO L280 TraceCheckUtils]: 13: Hoare triple {727#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {727#false} is VALID [2020-07-28 15:02:43,258 INFO L280 TraceCheckUtils]: 14: Hoare triple {727#false} assume 0bv32 == __VERIFIER_assert_~cond; {727#false} is VALID [2020-07-28 15:02:43,258 INFO L280 TraceCheckUtils]: 15: Hoare triple {727#false} assume !false; {727#false} is VALID [2020-07-28 15:02:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:43,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 15:02:43,771 INFO L280 TraceCheckUtils]: 15: Hoare triple {727#false} assume !false; {727#false} is VALID [2020-07-28 15:02:43,772 INFO L280 TraceCheckUtils]: 14: Hoare triple {727#false} assume 0bv32 == __VERIFIER_assert_~cond; {727#false} is VALID [2020-07-28 15:02:43,772 INFO L280 TraceCheckUtils]: 13: Hoare triple {727#false} __VERIFIER_assert_#in~cond := (if ~bvurem32(main_~x~0, 2bv32) == ~bvurem32(main_~y~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {727#false} is VALID [2020-07-28 15:02:43,773 INFO L280 TraceCheckUtils]: 12: Hoare triple {796#(bvult ULTIMATE.start_main_~x~0 (_ bv99 32))} assume !~bvult32(main_~x~0, 99bv32); {727#false} is VALID [2020-07-28 15:02:43,773 INFO L280 TraceCheckUtils]: 11: Hoare triple {800#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {796#(bvult ULTIMATE.start_main_~x~0 (_ bv99 32))} is VALID [2020-07-28 15:02:43,777 INFO L280 TraceCheckUtils]: 10: Hoare triple {804#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {800#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {808#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv6 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {804#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,790 INFO L280 TraceCheckUtils]: 8: Hoare triple {812#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv8 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {808#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv6 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,794 INFO L280 TraceCheckUtils]: 7: Hoare triple {816#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv10 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {812#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv8 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,798 INFO L280 TraceCheckUtils]: 6: Hoare triple {820#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv12 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {816#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv10 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {824#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv14 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {820#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv12 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {828#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv16 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {824#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv14 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,811 INFO L280 TraceCheckUtils]: 3: Hoare triple {832#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv18 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {828#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv16 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {836#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv19 32)) (_ bv99 32))} assume 0bv32 == ~bvurem32(main_~y~0, 2bv32);main_#t~post1 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post1);havoc main_#t~post1; {832#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv18 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {836#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv19 32)) (_ bv99 32))} assume !!~bvult32(main_~x~0, 99bv32); {836#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv19 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {726#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0bv32;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; {836#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv19 32)) (_ bv99 32))} is VALID [2020-07-28 15:02:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 15:02:43,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636497868] [2020-07-28 15:02:43,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 15:02:43,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2020-07-28 15:02:43,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748036277] [2020-07-28 15:02:43,819 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 16 [2020-07-28 15:02:43,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 15:02:43,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-28 15:02:43,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-28 15:02:43,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 15:02:43,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-28 15:02:43,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2020-07-28 15:02:43,910 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 24 states. [2020-07-28 15:02:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:49,140 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-07-28 15:02:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-28 15:02:49,141 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 16 [2020-07-28 15:02:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 15:02:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 15:02:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 62 transitions. [2020-07-28 15:02:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 15:02:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 62 transitions. [2020-07-28 15:02:49,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 62 transitions. [2020-07-28 15:02:49,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 15:02:49,320 INFO L225 Difference]: With dead ends: 60 [2020-07-28 15:02:49,320 INFO L226 Difference]: Without dead ends: 56 [2020-07-28 15:02:49,321 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=494, Invalid=912, Unknown=0, NotChecked=0, Total=1406 [2020-07-28 15:02:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-28 15:02:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2020-07-28 15:02:49,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 15:02:49,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 50 states. [2020-07-28 15:02:49,337 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 50 states. [2020-07-28 15:02:49,338 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 50 states. [2020-07-28 15:02:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:49,341 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-28 15:02:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-28 15:02:49,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:49,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:49,342 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 56 states. [2020-07-28 15:02:49,342 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 56 states. [2020-07-28 15:02:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 15:02:49,345 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-28 15:02:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-28 15:02:49,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 15:02:49,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 15:02:49,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 15:02:49,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 15:02:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-28 15:02:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2020-07-28 15:02:49,350 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 16 [2020-07-28 15:02:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 15:02:49,351 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2020-07-28 15:02:49,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-28 15:02:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2020-07-28 15:02:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 15:02:49,352 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 15:02:49,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 15:02:49,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 15:02:49,572 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 15:02:49,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 15:02:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1301479604, now seen corresponding path program 1 times [2020-07-28 15:02:49,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 15:02:49,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991546724] [2020-07-28 15:02:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-28 15:02:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 15:02:49,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 15:02:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 15:02:49,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 15:02:49,625 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 15:02:49,625 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 15:02:49,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 15:02:49,844 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 15:02:49,845 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-28 15:02:49,845 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-28 15:02:49,845 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-28 15:02:49,845 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-28 15:02:49,846 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 15:02:49,846 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 15:02:49,846 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 15:02:49,846 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 15:02:49,846 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 15:02:49,846 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 15:02:49,847 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 15:02:49,847 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-28 15:02:49,847 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-28 15:02:49,847 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 15:02:49,847 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 15:02:49,847 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 15:02:49,848 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 15:02:49,848 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 15:02:49,848 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-28 15:02:49,848 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-28 15:02:49,848 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-28 15:02:49,848 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-28 15:02:49,849 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-28 15:02:49,849 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-28 15:02:49,849 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-28 15:02:49,849 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-28 15:02:49,849 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 15:02:49,849 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 15:02:49,850 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 15:02:49,850 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 15:02:49,850 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 15:02:49,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 03:02:49 BoogieIcfgContainer [2020-07-28 15:02:49,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 15:02:49,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 15:02:49,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 15:02:49,853 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 15:02:49,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 03:02:39" (3/4) ... [2020-07-28 15:02:49,856 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 15:02:49,922 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 15:02:49,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 15:02:49,925 INFO L168 Benchmark]: Toolchain (without parser) took 10866.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 954.9 MB in the beginning and 892.9 MB in the end (delta: 62.0 MB). Peak memory consumption was 270.6 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:49,926 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 15:02:49,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.26 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:49,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:49,928 INFO L168 Benchmark]: Boogie Preprocessor took 53.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 15:02:49,928 INFO L168 Benchmark]: RCFGBuilder took 408.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:49,929 INFO L168 Benchmark]: TraceAbstraction took 9852.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 900.5 MB in the end (delta: 212.4 MB). Peak memory consumption was 277.9 MB. Max. memory is 11.5 GB. [2020-07-28 15:02:49,929 INFO L168 Benchmark]: Witness Printer took 69.81 ms. Allocated memory is still 1.2 GB. Free memory is still 892.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 15:02:49,932 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.26 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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 138.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 408.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9852.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 900.5 MB in the end (delta: 212.4 MB). Peak memory consumption was 277.9 MB. Max. memory is 11.5 GB. * Witness Printer took 69.81 ms. Allocated memory is still 1.2 GB. Free memory is still 892.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] unsigned int x = 0; [L13] unsigned int y = __VERIFIER_nondet_uint(); [L15] COND TRUE x < 99 [L16] COND FALSE !(y % 2 == 0) [L17] x += 2 [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 [L22] COND FALSE !(y % 2 == 0) [L23] x += 2 [L25] COND FALSE !(y % 2 == 0) [L26] x -= 2 [L28] COND FALSE !(y % 2 == 0) [L29] x += 2 [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 [L34] COND FALSE !(y % 2 == 0) [L35] x += 4 [L37] COND FALSE !(y % 2 == 0) [L38] x += 2 [L40] COND FALSE !(y % 2 == 0) [L41] x -= 4 [L43] COND FALSE !(y % 2 == 0) [L44] x -= 4 [L15] COND FALSE !(x < 99) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.7s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 90 SDtfs, 73 SDslu, 34 SDs, 0 SdLazy, 454 SolverSat, 304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 4100 SizeOfPredicates, 2 NumberOfNonLiveVariables, 108 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...