./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gsv2008.c.i.p+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/loop-lit/gsv2008.c.i.p+cfa-reducer.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ddf982557921584bb127c3d2f445aa0e6d0bc14c3d676da7af6c5c29bbe3794a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:04:03,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:04:03,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:04:03,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:04:03,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:04:03,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:04:03,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:04:03,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:04:03,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:04:03,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:04:03,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:04:03,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:04:03,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:04:03,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:04:03,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:04:03,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:04:03,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:04:03,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:04:03,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:04:03,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:04:03,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:04:03,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:04:03,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:04:03,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:04:03,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:04:03,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:04:03,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:04:03,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:04:03,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:04:03,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:04:03,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:04:03,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:04:03,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:04:03,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:04:03,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:04:03,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:04:03,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:04:03,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:04:03,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:04:03,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:04:03,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:04:03,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:04:03,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:04:03,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:04:03,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:04:03,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:04:03,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:04:03,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:04:03,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:04:03,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:04:03,400 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:04:03,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:04:03,400 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:04:03,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:04:03,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:04:03,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:04:03,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:04:03,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:04:03,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:04:03,401 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:04:03,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:04:03,401 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:04:03,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:04:03,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:04:03,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:04:03,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:04:03,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:04:03,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:04:03,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:04:03,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:04:03,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:04:03,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:04:03,403 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:04:03,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:04:03,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:04:03,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> ddf982557921584bb127c3d2f445aa0e6d0bc14c3d676da7af6c5c29bbe3794a [2022-02-20 17:04:03,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:04:03,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:04:03,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:04:03,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:04:03,606 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:04:03,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2022-02-20 17:04:03,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88425fb4/9700c5502a5147b2a7a5d3ffbceef46a/FLAG0c9984ec0 [2022-02-20 17:04:04,050 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:04:04,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2022-02-20 17:04:04,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88425fb4/9700c5502a5147b2a7a5d3ffbceef46a/FLAG0c9984ec0 [2022-02-20 17:04:04,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88425fb4/9700c5502a5147b2a7a5d3ffbceef46a [2022-02-20 17:04:04,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:04:04,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:04:04,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:04:04,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:04:04,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:04:04,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23986988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04, skipping insertion in model container [2022-02-20 17:04:04,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:04:04,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:04:04,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gsv2008.c.i.p+cfa-reducer.c[989,1002] [2022-02-20 17:04:04,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:04:04,233 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:04:04,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gsv2008.c.i.p+cfa-reducer.c[989,1002] [2022-02-20 17:04:04,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:04:04,253 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:04:04,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04 WrapperNode [2022-02-20 17:04:04,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:04:04,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:04:04,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:04:04,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:04:04,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,281 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2022-02-20 17:04:04,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:04:04,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:04:04,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:04:04,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:04:04,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:04:04,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:04:04,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:04:04,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:04:04,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (1/1) ... [2022-02-20 17:04:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:04:04,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:04:04,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:04:04,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:04:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:04:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:04:04,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:04:04,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:04:04,412 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:04:04,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:04:04,498 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:04:04,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:04:04,502 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 17:04:04,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:04 BoogieIcfgContainer [2022-02-20 17:04:04,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:04:04,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:04:04,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:04:04,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:04:04,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:04:04" (1/3) ... [2022-02-20 17:04:04,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f794bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:04:04, skipping insertion in model container [2022-02-20 17:04:04,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:04" (2/3) ... [2022-02-20 17:04:04,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f794bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:04:04, skipping insertion in model container [2022-02-20 17:04:04,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:04" (3/3) ... [2022-02-20 17:04:04,510 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.p+cfa-reducer.c [2022-02-20 17:04:04,513 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:04:04,513 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:04:04,544 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:04:04,548 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:04:04,549 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:04:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:04:04,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:04:04,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:04:04,563 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:04:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:04:04,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1806908747, now seen corresponding path program 1 times [2022-02-20 17:04:04,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:04:04,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098612653] [2022-02-20 17:04:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:04,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:04:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:04,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {14#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_144~0 := 0; {14#true} is VALID [2022-02-20 17:04:04,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {14#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__x~0#1, main_~main__y~0#1;havoc main_~main__x~0#1;havoc main_~main__y~0#1;main_~main__x~0#1 := -50;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {16#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:04,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(-1000 < main_~main__y~0#1); {16#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:04,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(main_~main__y~0#1 < 1000000); {16#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:04,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !(main_~main__x~0#1 < 0);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__y~0#1 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {15#false} is VALID [2022-02-20 17:04:04,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {15#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {15#false} is VALID [2022-02-20 17:04:04,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {15#false} assume !false; {15#false} is VALID [2022-02-20 17:04:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:04,790 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:04:04,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098612653] [2022-02-20 17:04:04,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098612653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:04:04,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:04:04,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:04:04,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200121174] [2022-02-20 17:04:04,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:04:04,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:04:04,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:04:04,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:04,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:04:04,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:04:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:04:04,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:04:04,838 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:04,881 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 17:04:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:04:04,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:04:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:04:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 17:04:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-20 17:04:04,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-20 17:04:04,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:04,915 INFO L225 Difference]: With dead ends: 21 [2022-02-20 17:04:04,915 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 17:04:04,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:04:04,920 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:04:04,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:04:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 17:04:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 17:04:04,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:04:04,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,940 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,941 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:04,942 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 17:04:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:04:04,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:04,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:04,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 17:04:04,943 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states. [2022-02-20 17:04:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:04,944 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 17:04:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:04:04,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:04,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:04,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:04:04,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:04:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 17:04:04,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-02-20 17:04:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:04:04,947 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 17:04:04,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:04:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:04:04,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:04:04,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:04:04,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:04:04,948 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:04:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:04:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 179533835, now seen corresponding path program 1 times [2022-02-20 17:04:04,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:04:04,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854435818] [2022-02-20 17:04:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:04:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:05,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {74#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_144~0 := 0; {74#true} is VALID [2022-02-20 17:04:05,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {74#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__x~0#1, main_~main__y~0#1;havoc main_~main__x~0#1;havoc main_~main__y~0#1;main_~main__x~0#1 := -50;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:05,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(-1000 < main_~main__y~0#1); {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:05,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(main_~main__y~0#1 < 1000000); {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:05,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~0#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1; {77#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} is VALID [2022-02-20 17:04:05,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {77#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} assume !(main_~main__x~0#1 < 0);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__y~0#1 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {78#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 17:04:05,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {75#false} is VALID [2022-02-20 17:04:05,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {75#false} assume !false; {75#false} is VALID [2022-02-20 17:04:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:05,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:04:05,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854435818] [2022-02-20 17:04:05,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854435818] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:04:05,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510028509] [2022-02-20 17:04:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:05,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:04:05,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:04:05,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:04:05,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:04:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:05,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:04:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:05,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:04:05,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {74#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_144~0 := 0; {74#true} is VALID [2022-02-20 17:04:05,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {74#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__x~0#1, main_~main__y~0#1;havoc main_~main__x~0#1;havoc main_~main__y~0#1;main_~main__x~0#1 := -50;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:05,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(-1000 < main_~main__y~0#1); {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:05,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(main_~main__y~0#1 < 1000000); {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:05,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {76#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~0#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1; {77#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} is VALID [2022-02-20 17:04:05,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {77#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} assume !(main_~main__x~0#1 < 0);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__y~0#1 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {97#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} is VALID [2022-02-20 17:04:05,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {97#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} assume 0 == main_~__VERIFIER_assert__cond~0#1; {75#false} is VALID [2022-02-20 17:04:05,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {75#false} assume !false; {75#false} is VALID [2022-02-20 17:04:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:05,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:04:05,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {75#false} assume !false; {75#false} is VALID [2022-02-20 17:04:05,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {97#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} assume 0 == main_~__VERIFIER_assert__cond~0#1; {75#false} is VALID [2022-02-20 17:04:05,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#(or (< 0 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 0))} assume !(main_~main__x~0#1 < 0);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__y~0#1 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {97#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} is VALID [2022-02-20 17:04:05,371 INFO L290 TraceCheckUtils]: 4: Hoare triple {114#(< |ULTIMATE.start_main_~main__x~0#1| 1)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~0#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1; {110#(or (< 0 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 0))} is VALID [2022-02-20 17:04:05,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {114#(< |ULTIMATE.start_main_~main__x~0#1| 1)} assume !!(main_~main__y~0#1 < 1000000); {114#(< |ULTIMATE.start_main_~main__x~0#1| 1)} is VALID [2022-02-20 17:04:05,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {114#(< |ULTIMATE.start_main_~main__x~0#1| 1)} assume !!(-1000 < main_~main__y~0#1); {114#(< |ULTIMATE.start_main_~main__x~0#1| 1)} is VALID [2022-02-20 17:04:05,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {74#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__x~0#1, main_~main__y~0#1;havoc main_~main__x~0#1;havoc main_~main__y~0#1;main_~main__x~0#1 := -50;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {114#(< |ULTIMATE.start_main_~main__x~0#1| 1)} is VALID [2022-02-20 17:04:05,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {74#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_144~0 := 0; {74#true} is VALID [2022-02-20 17:04:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:05,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510028509] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:04:05,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:04:05,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-20 17:04:05,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829934068] [2022-02-20 17:04:05,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:04:05,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:04:05,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:04:05,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:05,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:04:05,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:04:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:04:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:04:05,392 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:05,443 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-20 17:04:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:04:05,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:04:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:04:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2022-02-20 17:04:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2022-02-20 17:04:05,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 12 transitions. [2022-02-20 17:04:05,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:05,454 INFO L225 Difference]: With dead ends: 11 [2022-02-20 17:04:05,454 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:04:05,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:04:05,455 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:04:05,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:04:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:04:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:04:05,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:04:05,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,457 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,457 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:05,457 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:04:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:05,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:05,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:05,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:04:05,458 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:04:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:05,458 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:04:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:05,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:05,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:05,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:04:05,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:04:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:04:05,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2022-02-20 17:04:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:04:05,460 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:04:05,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:05,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:05,462 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:04:05,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:04:05,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:04:05,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:04:05,719 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:04:05,719 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 58) no Hoare annotation was computed. [2022-02-20 17:04:05,720 INFO L861 garLoopResultBuilder]: At program point L54(lines 13 60) the Hoare annotation is: true [2022-02-20 17:04:05,720 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 59) no Hoare annotation was computed. [2022-02-20 17:04:05,720 INFO L858 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-02-20 17:04:05,720 INFO L858 garLoopResultBuilder]: For program point L46(lines 46 55) no Hoare annotation was computed. [2022-02-20 17:04:05,720 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:04:05,720 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:04:05,720 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:04:05,721 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-02-20 17:04:05,721 INFO L854 garLoopResultBuilder]: At program point L37(lines 30 58) the Hoare annotation is: (or (< 0 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 0)) [2022-02-20 17:04:05,723 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 17:04:05,724 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:04:05,727 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:04:05,727 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:04:05,728 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:04:05,728 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:04:05,728 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:04:05,728 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 17:04:05,728 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 17:04:05,728 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:04:05,730 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:04:05,730 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:04:05,730 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 17:04:05,730 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 17:04:05,730 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 17:04:05,730 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:04:05,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:04:05 BoogieIcfgContainer [2022-02-20 17:04:05,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:04:05,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:04:05,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:04:05,737 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:04:05,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:04" (3/4) ... [2022-02-20 17:04:05,739 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:04:05,746 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 17:04:05,746 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:04:05,746 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:04:05,746 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:04:05,766 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:04:05,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:04:05,767 INFO L158 Benchmark]: Toolchain (without parser) took 1693.32ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 65.2MB in the beginning and 74.3MB in the end (delta: -9.1MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-02-20 17:04:05,767 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:04:05,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.00ms. Allocated memory is still 88.1MB. Free memory was 64.9MB in the beginning and 62.0MB in the end (delta: 3.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:04:05,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.27ms. Allocated memory is still 88.1MB. Free memory was 62.0MB in the beginning and 60.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:04:05,768 INFO L158 Benchmark]: Boogie Preprocessor took 20.10ms. Allocated memory is still 88.1MB. Free memory was 60.4MB in the beginning and 59.5MB in the end (delta: 957.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:04:05,769 INFO L158 Benchmark]: RCFGBuilder took 200.72ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 50.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:04:05,769 INFO L158 Benchmark]: TraceAbstraction took 1231.43ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 49.6MB in the beginning and 76.4MB in the end (delta: -26.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2022-02-20 17:04:05,769 INFO L158 Benchmark]: Witness Printer took 29.45ms. Allocated memory is still 115.3MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:04:05,770 INFO L339 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.14ms. Allocated memory is still 88.1MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.00ms. Allocated memory is still 88.1MB. Free memory was 64.9MB in the beginning and 62.0MB in the end (delta: 3.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.27ms. Allocated memory is still 88.1MB. Free memory was 62.0MB in the beginning and 60.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.10ms. Allocated memory is still 88.1MB. Free memory was 60.4MB in the beginning and 59.5MB in the end (delta: 957.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 200.72ms. Allocated memory is still 88.1MB. Free memory was 59.5MB in the beginning and 50.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1231.43ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 49.6MB in the beginning and 76.4MB in the end (delta: -26.7MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * Witness Printer took 29.45ms. Allocated memory is still 115.3MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 16 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 8 HoareAnnotationTreeSize, 2 FomulaSimplifications, 5 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 4 NumberOfNonLiveVariables, 50 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 0 < main__y || main__x < 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:04:05,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE