./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/nla-digbench-scaling/bresenham-ll_unwindbound10.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 d8ee33f278cd93a3b1e0d551730c6407889b70e338ebc3c857541220d9b0f75f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:58:57,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:58:57,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:58:57,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:58:57,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:58:57,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:58:57,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:58:57,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:58:57,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:58:57,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:58:57,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:58:57,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:58:57,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:58:57,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:58:57,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:58:57,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:58:57,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:58:57,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:58:57,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:58:57,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:58:57,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:58:57,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:58:57,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:58:57,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:58:57,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:58:57,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:58:57,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:58:57,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:58:57,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:58:57,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:58:57,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:58:57,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:58:57,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:58:57,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:58:57,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:58:57,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:58:57,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:58:57,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:58:57,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:58:57,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:58:57,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:58:57,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:58:57,693 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:58:57,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:58:57,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:58:57,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:58:57,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:58:57,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:58:57,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:58:57,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:58:57,698 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:58:57,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:58:57,698 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:58:57,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:58:57,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:58:57,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:58:57,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:58:57,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:58:57,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:58:57,700 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:58:57,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:58:57,700 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:58:57,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:58:57,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:58:57,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:58:57,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:58:57,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:58:57,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:58:57,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:58:57,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:58:57,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:58:57,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:58:57,701 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:58:57,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:58:57,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:58:57,702 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:58:57,702 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 -> d8ee33f278cd93a3b1e0d551730c6407889b70e338ebc3c857541220d9b0f75f [2021-12-14 13:58:57,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:58:57,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:58:57,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:58:57,927 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:58:57,928 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:58:57,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2021-12-14 13:58:57,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9dc8f91/81188b534e4645b0a8d470153681e374/FLAGec9388ed9 [2021-12-14 13:58:58,348 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:58:58,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2021-12-14 13:58:58,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9dc8f91/81188b534e4645b0a8d470153681e374/FLAGec9388ed9 [2021-12-14 13:58:58,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9dc8f91/81188b534e4645b0a8d470153681e374 [2021-12-14 13:58:58,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:58:58,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:58:58,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:58:58,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:58:58,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:58:58,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ba9fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58, skipping insertion in model container [2021-12-14 13:58:58,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:58:58,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:58:58,544 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/nla-digbench-scaling/bresenham-ll_unwindbound10.c[597,610] [2021-12-14 13:58:58,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:58:58,568 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:58:58,575 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/nla-digbench-scaling/bresenham-ll_unwindbound10.c[597,610] [2021-12-14 13:58:58,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:58:58,602 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:58:58,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58 WrapperNode [2021-12-14 13:58:58,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:58:58,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:58:58,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:58:58,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:58:58,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,627 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-12-14 13:58:58,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:58:58,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:58:58,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:58:58,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:58:58,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:58:58,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:58:58,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:58:58,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:58:58,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (1/1) ... [2021-12-14 13:58:58,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:58:58,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:58:58,691 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) [2021-12-14 13:58:58,713 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 [2021-12-14 13:58:58,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:58:58,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:58:58,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:58:58,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:58:58,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 13:58:58,746 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 13:58:58,808 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:58:58,809 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:58:58,918 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:58:58,922 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:58:58,922 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 13:58:58,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:58:58 BoogieIcfgContainer [2021-12-14 13:58:58,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:58:58,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:58:58,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:58:58,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:58:58,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:58:58" (1/3) ... [2021-12-14 13:58:58,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d231d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:58:58, skipping insertion in model container [2021-12-14 13:58:58,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:58:58" (2/3) ... [2021-12-14 13:58:58,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d231d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:58:58, skipping insertion in model container [2021-12-14 13:58:58,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:58:58" (3/3) ... [2021-12-14 13:58:58,929 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound10.c [2021-12-14 13:58:58,932 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:58:58,932 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:58:58,962 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:58:58,966 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 [2021-12-14 13:58:58,967 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:58:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:58:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 13:58:58,979 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:58:58,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:58:58,980 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:58:58,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:58:58,983 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2021-12-14 13:58:58,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:58:58,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88109075] [2021-12-14 13:58:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:58:58,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:58:59,048 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:58:59,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68742579] [2021-12-14 13:58:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:58:59,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:58:59,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:58:59,051 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) [2021-12-14 13:58:59,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:58:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:58:59,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 13:58:59,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:58:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:58:59,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:58:59,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:58:59,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88109075] [2021-12-14 13:58:59,350 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:58:59,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68742579] [2021-12-14 13:58:59,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68742579] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:58:59,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:58:59,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:58:59,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994363881] [2021-12-14 13:58:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:58:59,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:58:59,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:58:59,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:58:59,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:58:59,377 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:58:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:58:59,481 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2021-12-14 13:58:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:58:59,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 13:58:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:58:59,488 INFO L225 Difference]: With dead ends: 54 [2021-12-14 13:58:59,489 INFO L226 Difference]: Without dead ends: 25 [2021-12-14 13:58:59,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:58:59,493 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:58:59,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:58:59,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-14 13:58:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-14 13:58:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:58:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-14 13:58:59,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2021-12-14 13:58:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:58:59,536 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-14 13:58:59,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:58:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-14 13:58:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:58:59,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:58:59,539 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:58:59,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 13:58:59,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-14 13:58:59,756 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:58:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:58:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2021-12-14 13:58:59,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:58:59,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558651801] [2021-12-14 13:58:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:58:59,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:58:59,774 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:58:59,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373331114] [2021-12-14 13:58:59,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:58:59,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:58:59,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:58:59,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:58:59,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:58:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:58:59,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 13:58:59,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:00,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:59:00,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:00,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558651801] [2021-12-14 13:59:00,121 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:00,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373331114] [2021-12-14 13:59:00,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373331114] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:00,122 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:00,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2021-12-14 13:59:00,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778937240] [2021-12-14 13:59:00,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:00,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:59:00,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:00,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:59:00,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:59:00,124 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:00,288 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-12-14 13:59:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:59:00,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-12-14 13:59:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:00,289 INFO L225 Difference]: With dead ends: 41 [2021-12-14 13:59:00,289 INFO L226 Difference]: Without dead ends: 34 [2021-12-14 13:59:00,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-14 13:59:00,291 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:00,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:59:00,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-14 13:59:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-14 13:59:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:59:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-14 13:59:00,299 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-12-14 13:59:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:00,299 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-14 13:59:00,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-14 13:59:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:59:00,302 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:00,302 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:00,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:00,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-14 13:59:00,508 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2021-12-14 13:59:00,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:00,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440138406] [2021-12-14 13:59:00,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:00,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:00,515 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:00,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580408458] [2021-12-14 13:59:00,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:00,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:00,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:00,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:59:00,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:59:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:00,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 13:59:00,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:00,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:00,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:00,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440138406] [2021-12-14 13:59:00,620 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:00,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580408458] [2021-12-14 13:59:00,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580408458] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:00,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:00,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-14 13:59:00,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781525656] [2021-12-14 13:59:00,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:00,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:59:00,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:00,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:59:00,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:59:00,622 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:00,673 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2021-12-14 13:59:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 13:59:00,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-12-14 13:59:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:00,674 INFO L225 Difference]: With dead ends: 73 [2021-12-14 13:59:00,674 INFO L226 Difference]: Without dead ends: 67 [2021-12-14 13:59:00,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:59:00,675 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:00,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:59:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-14 13:59:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2021-12-14 13:59:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:59:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-12-14 13:59:00,682 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2021-12-14 13:59:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:00,682 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-12-14 13:59:00,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:59:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-12-14 13:59:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:59:00,683 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:00,684 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:00,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-14 13:59:00,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:00,891 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2021-12-14 13:59:00,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:00,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103496979] [2021-12-14 13:59:00,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:00,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:00,917 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:00,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865328767] [2021-12-14 13:59:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:00,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:00,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:00,919 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:59:00,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:59:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:00,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 13:59:00,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:59:01,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:59:01,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:01,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103496979] [2021-12-14 13:59:01,530 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:01,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865328767] [2021-12-14 13:59:01,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865328767] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:01,530 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:01,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-12-14 13:59:01,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245678822] [2021-12-14 13:59:01,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:01,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-14 13:59:01,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-14 13:59:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-12-14 13:59:01,532 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:59:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:02,137 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-12-14 13:59:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 13:59:02,138 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2021-12-14 13:59:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:02,139 INFO L225 Difference]: With dead ends: 65 [2021-12-14 13:59:02,139 INFO L226 Difference]: Without dead ends: 57 [2021-12-14 13:59:02,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2021-12-14 13:59:02,140 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:02,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:59:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-14 13:59:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2021-12-14 13:59:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:59:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-14 13:59:02,146 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2021-12-14 13:59:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:02,146 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-14 13:59:02,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-14 13:59:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-14 13:59:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 13:59:02,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:02,147 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:02,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:02,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:02,359 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2021-12-14 13:59:02,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:02,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944864819] [2021-12-14 13:59:02,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:02,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:02,367 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151355937] [2021-12-14 13:59:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:02,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:02,370 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:59:02,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:59:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:59:02,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 13:59:02,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:59:02,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 13:59:02,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944864819] [2021-12-14 13:59:02,640 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151355937] [2021-12-14 13:59:02,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151355937] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:02,640 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:02,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-14 13:59:02,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154461040] [2021-12-14 13:59:02,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:02,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 13:59:02,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 13:59:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-14 13:59:02,642 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 13:59:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:02,782 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2021-12-14 13:59:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 13:59:02,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 49 [2021-12-14 13:59:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:02,786 INFO L225 Difference]: With dead ends: 116 [2021-12-14 13:59:02,786 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 13:59:02,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-14 13:59:02,788 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:02,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 160 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:59:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 13:59:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-14 13:59:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.125) internal successors, (99), 88 states have internal predecessors, (99), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-12-14 13:59:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-14 13:59:02,812 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2021-12-14 13:59:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:02,812 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-14 13:59:02,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-14 13:59:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-14 13:59:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-14 13:59:02,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:02,823 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:02,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:03,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:03,024 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2021-12-14 13:59:03,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:03,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076534823] [2021-12-14 13:59:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:03,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:03,032 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:03,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307329926] [2021-12-14 13:59:03,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:59:03,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:03,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:03,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:59:03,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:59:03,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:59:03,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:59:03,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-14 13:59:03,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:59:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-14 13:59:03,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:59:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-14 13:59:05,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:59:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076534823] [2021-12-14 13:59:05,593 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-14 13:59:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307329926] [2021-12-14 13:59:05,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307329926] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:59:05,593 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:59:05,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 48 [2021-12-14 13:59:05,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543962395] [2021-12-14 13:59:05,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:59:05,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-14 13:59:05,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:59:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-14 13:59:05,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1941, Unknown=0, NotChecked=0, Total=2256 [2021-12-14 13:59:05,595 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 48 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 22 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-14 13:59:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:59:06,918 INFO L93 Difference]: Finished difference Result 220 states and 244 transitions. [2021-12-14 13:59:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-14 13:59:06,919 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 22 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2021-12-14 13:59:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:59:06,920 INFO L225 Difference]: With dead ends: 220 [2021-12-14 13:59:06,920 INFO L226 Difference]: Without dead ends: 212 [2021-12-14 13:59:06,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=568, Invalid=3338, Unknown=0, NotChecked=0, Total=3906 [2021-12-14 13:59:06,922 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 86 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 13:59:06,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 853 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 13:59:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-14 13:59:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2021-12-14 13:59:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 160 states have (on average 1.125) internal successors, (180), 160 states have internal predecessors, (180), 20 states have call successors, (20), 20 states have call predecessors, (20), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-14 13:59:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2021-12-14 13:59:06,934 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 219 transitions. Word has length 109 [2021-12-14 13:59:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:59:06,935 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 219 transitions. [2021-12-14 13:59:06,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 2.5) internal successors, (115), 47 states have internal predecessors, (115), 22 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-14 13:59:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2021-12-14 13:59:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-14 13:59:06,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:59:06,936 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:59:06,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:59:07,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:07,140 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:59:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:59:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash 977369872, now seen corresponding path program 1 times [2021-12-14 13:59:07,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:59:07,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528451189] [2021-12-14 13:59:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:07,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:59:07,147 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-14 13:59:07,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642185305] [2021-12-14 13:59:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:59:07,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:07,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:59:07,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:59:07,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 13:59:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:59:07,238 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 13:59:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 13:59:07,309 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 13:59:07,309 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 13:59:07,310 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 13:59:07,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 13:59:07,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:59:07,530 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2021-12-14 13:59:07,532 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 13:59:07,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:59:07 BoogieIcfgContainer [2021-12-14 13:59:07,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 13:59:07,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 13:59:07,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 13:59:07,572 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 13:59:07,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:58:58" (3/4) ... [2021-12-14 13:59:07,574 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 13:59:07,635 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 13:59:07,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 13:59:07,636 INFO L158 Benchmark]: Toolchain (without parser) took 9263.60ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 74.4MB in the beginning and 61.5MB in the end (delta: 12.9MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2021-12-14 13:59:07,636 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory was 63.6MB in the beginning and 63.5MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:59:07,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.33ms. Allocated memory is still 104.9MB. Free memory was 74.1MB in the beginning and 80.5MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 13:59:07,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.28ms. Allocated memory is still 104.9MB. Free memory was 80.5MB in the beginning and 79.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 13:59:07,637 INFO L158 Benchmark]: Boogie Preprocessor took 25.61ms. Allocated memory is still 104.9MB. Free memory was 79.0MB in the beginning and 78.1MB in the end (delta: 836.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 13:59:07,637 INFO L158 Benchmark]: RCFGBuilder took 269.22ms. Allocated memory is still 104.9MB. Free memory was 78.1MB in the beginning and 68.5MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 13:59:07,637 INFO L158 Benchmark]: TraceAbstraction took 8647.38ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 67.7MB in the beginning and 67.8MB in the end (delta: -133.4kB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2021-12-14 13:59:07,637 INFO L158 Benchmark]: Witness Printer took 63.11ms. Allocated memory is still 125.8MB. Free memory was 67.8MB in the beginning and 61.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 13:59:07,639 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory was 63.6MB in the beginning and 63.5MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.33ms. Allocated memory is still 104.9MB. Free memory was 74.1MB in the beginning and 80.5MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.28ms. Allocated memory is still 104.9MB. Free memory was 80.5MB in the beginning and 79.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.61ms. Allocated memory is still 104.9MB. Free memory was 79.0MB in the beginning and 78.1MB in the end (delta: 836.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 269.22ms. Allocated memory is still 104.9MB. Free memory was 78.1MB in the beginning and 68.5MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8647.38ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 67.7MB in the beginning and 67.8MB in the end (delta: -133.4kB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 63.11ms. Allocated memory is still 125.8MB. Free memory was 67.8MB in the beginning and 61.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0, v=-33, X=37, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-33, X=37, x=0, Y=2, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-33, x=0, x=0, X=37, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=1, v=-33, X=37, x=0, x=0, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-33, X=37, x=0, x=0, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-29, x=0, x=0, X=37, x=0, y=0, Y=2] [L45] x++ VAL [counter=1, v=-29, x=0, X=37, x=0, x=1, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-29, x=0, X=37, x=1, x=0, Y=2, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-29, x=1, x=2, x=0, X=37, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-29, X=37, x=2, x=0, x=1, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-29, x=0, X=37, x=1, x=2, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-25, x=1, x=0, x=2, X=37, y=0, Y=2] [L45] x++ VAL [counter=2, v=-25, x=2, X=37, x=2, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-25, x=0, x=2, x=2, X=37, y=0, Y=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-25, x=4, x=2, x=0, X=37, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=3, v=-25, x=4, x=2, x=0, X=37, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-25, x=2, X=37, x=0, x=4, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-21, x=2, x=4, x=0, X=37, y=0, Y=2] [L45] x++ VAL [counter=3, v=-21, X=37, x=3, x=4, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-21, X=37, x=3, x=4, x=0, Y=2, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-21, x=0, x=3, X=37, x=6, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-21, x=0, x=6, X=37, x=3, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-21, x=0, x=6, x=3, X=37, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-17, x=6, X=37, x=3, x=0, y=0, Y=2] [L45] x++ VAL [counter=4, v=-17, x=0, X=37, x=4, x=6, Y=2, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-17, X=37, x=4, x=0, x=6, Y=2, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-17, X=37, x=8, x=4, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=5, v=-17, x=8, x=0, x=4, X=37, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-17, x=0, X=37, x=8, x=4, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-13, x=0, x=8, x=4, X=37, Y=2, y=0] [L45] x++ VAL [counter=5, v=-13, x=0, X=37, x=8, x=5, Y=2, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-13, x=8, x=5, x=0, X=37, y=0, Y=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-13, X=37, x=0, x=10, x=5, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-13, x=5, x=10, X=37, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-13, x=0, x=5, X=37, x=10, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-9, x=10, X=37, x=5, x=0, Y=2, y=0] [L45] x++ VAL [counter=6, v=-9, x=0, X=37, x=6, x=10, Y=2, y=0] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-9, x=6, X=37, x=0, x=10, Y=2, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-9, X=37, x=12, x=6, x=0, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=7, v=-9, x=6, x=12, X=37, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-9, x=0, x=6, X=37, x=12, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-5, X=37, x=6, x=12, x=0, y=0, Y=2] [L45] x++ VAL [counter=7, v=-5, x=12, x=0, X=37, x=7, Y=2, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-5, x=12, x=0, X=37, x=7, y=0, Y=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-5, x=0, X=37, x=7, x=14, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-5, x=14, X=37, x=7, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-5, x=0, x=7, x=14, X=37, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-1, x=0, x=14, X=37, x=7, y=0, Y=2] [L45] x++ VAL [counter=8, v=-1, x=14, X=37, x=0, x=8, y=0, Y=2] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-1, x=14, x=0, x=8, X=37, Y=2, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-1, x=0, x=16, X=37, x=8, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-1, x=16, x=8, x=0, X=37, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-1, x=16, x=0, x=8, X=37, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=3, x=16, x=0, X=37, x=8, Y=2, y=0] [L45] x++ VAL [counter=9, v=3, x=0, x=16, X=37, x=9, Y=2, y=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=3, X=37, x=16, x=0, x=9, y=0, Y=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=3, x=0, X=37, x=18, x=9, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=10, v=3, x=9, x=0, x=18, X=37, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=3, x=18, X=37, x=0, x=9, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=10, v=-67, x=0, x=9, X=37, x=18, y=1, Y=2] [L45] x++ VAL [counter=10, v=-67, x=18, x=0, X=37, x=10, Y=2, y=1] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-67, x=10, x=0, x=18, X=37, Y=2, y=1] [L31] COND FALSE !(counter++<10) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=11, v=-67, x=10, X=37, x=10, x=20, y=1, Y=2] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=11] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=11] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 1393 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1282 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2505 IncrementalHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 111 mSDtfsCounter, 2505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 337 SyntacticMatches, 3 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=6, InterpolantAutomatonStates: 116, 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, 6 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 3406 SizeOfPredicates, 21 NumberOfNonLiveVariables, 756 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 468/1174 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! [2021-12-14 13:59:07,677 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE