./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-16 00:14:03,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 00:14:03,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 00:14:03,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 00:14:03,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 00:14:03,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 00:14:03,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 00:14:03,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 00:14:03,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 00:14:03,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 00:14:03,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 00:14:03,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 00:14:03,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 00:14:03,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 00:14:03,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 00:14:04,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 00:14:04,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 00:14:04,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 00:14:04,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 00:14:04,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 00:14:04,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 00:14:04,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 00:14:04,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 00:14:04,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 00:14:04,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 00:14:04,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 00:14:04,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 00:14:04,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 00:14:04,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 00:14:04,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 00:14:04,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 00:14:04,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 00:14:04,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 00:14:04,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 00:14:04,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 00:14:04,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 00:14:04,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 00:14:04,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 00:14:04,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 00:14:04,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 00:14:04,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 00:14:04,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 00:14:04,072 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 00:14:04,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 00:14:04,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 00:14:04,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 00:14:04,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 00:14:04,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 00:14:04,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 00:14:04,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 00:14:04,076 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 00:14:04,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 00:14:04,077 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 00:14:04,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 00:14:04,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 00:14:04,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 00:14:04,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 00:14:04,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 00:14:04,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 00:14:04,079 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 00:14:04,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 00:14:04,079 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 00:14:04,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 00:14:04,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 00:14:04,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 00:14:04,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 00:14:04,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:14:04,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 00:14:04,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 00:14:04,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 00:14:04,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 00:14:04,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 00:14:04,082 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 00:14:04,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 00:14:04,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 00:14:04,083 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 00:14:04,083 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-16 00:14:04,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 00:14:04,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 00:14:04,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 00:14:04,309 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 00:14:04,310 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 00:14:04,311 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-16 00:14:04,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece577954/a0897c1d32f442d09a30f1b7bd9ff8ef/FLAG4fd918320 [2021-12-16 00:14:04,755 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 00:14:04,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2021-12-16 00:14:04,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece577954/a0897c1d32f442d09a30f1b7bd9ff8ef/FLAG4fd918320 [2021-12-16 00:14:05,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece577954/a0897c1d32f442d09a30f1b7bd9ff8ef [2021-12-16 00:14:05,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 00:14:05,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 00:14:05,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 00:14:05,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 00:14:05,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 00:14:05,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c91ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05, skipping insertion in model container [2021-12-16 00:14:05,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 00:14:05,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 00:14:05,366 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-16 00:14:05,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:14:05,403 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 00:14:05,423 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-16 00:14:05,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 00:14:05,441 INFO L208 MainTranslator]: Completed translation [2021-12-16 00:14:05,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05 WrapperNode [2021-12-16 00:14:05,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 00:14:05,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 00:14:05,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 00:14:05,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 00:14:05,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,470 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-12-16 00:14:05,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 00:14:05,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 00:14:05,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 00:14:05,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 00:14:05,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 00:14:05,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 00:14:05,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 00:14:05,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 00:14:05,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (1/1) ... [2021-12-16 00:14:05,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 00:14:05,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:05,529 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-16 00:14:05,559 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-16 00:14:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 00:14:05,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 00:14:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 00:14:05,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 00:14:05,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 00:14:05,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 00:14:05,632 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 00:14:05,633 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 00:14:05,787 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 00:14:05,792 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 00:14:05,793 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 00:14:05,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:14:05 BoogieIcfgContainer [2021-12-16 00:14:05,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 00:14:05,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 00:14:05,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 00:14:05,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 00:14:05,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:14:05" (1/3) ... [2021-12-16 00:14:05,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a5fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:14:05, skipping insertion in model container [2021-12-16 00:14:05,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:14:05" (2/3) ... [2021-12-16 00:14:05,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a5fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:14:05, skipping insertion in model container [2021-12-16 00:14:05,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:14:05" (3/3) ... [2021-12-16 00:14:05,828 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound10.c [2021-12-16 00:14:05,832 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 00:14:05,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-16 00:14:05,912 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 00:14:05,918 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-16 00:14:05,918 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-16 00:14:05,932 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-16 00:14:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 00:14:05,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:05,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:05,936 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2021-12-16 00:14:05,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:05,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274347452] [2021-12-16 00:14:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:05,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:06,018 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:06,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667767946] [2021-12-16 00:14:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:06,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:06,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:06,023 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-16 00:14:06,031 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-16 00:14:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:06,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 00:14:06,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:06,273 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-16 00:14:06,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 00:14:06,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:06,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274347452] [2021-12-16 00:14:06,274 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:06,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667767946] [2021-12-16 00:14:06,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667767946] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 00:14:06,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 00:14:06,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 00:14:06,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356915661] [2021-12-16 00:14:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 00:14:06,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 00:14:06,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:06,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 00:14:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 00:14:06,316 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-16 00:14:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:06,483 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2021-12-16 00:14:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 00:14:06,486 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-16 00:14:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:06,493 INFO L225 Difference]: With dead ends: 54 [2021-12-16 00:14:06,493 INFO L226 Difference]: Without dead ends: 25 [2021-12-16 00:14:06,496 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-16 00:14:06,499 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 00:14:06,501 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-16 00:14:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-16 00:14:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2021-12-16 00:14:06,538 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-16 00:14:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-16 00:14:06,541 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2021-12-16 00:14:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:06,541 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-16 00:14:06,542 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-16 00:14:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-16 00:14:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 00:14:06,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:06,546 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:06,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-16 00:14:06,763 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-16 00:14:06,764 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2021-12-16 00:14:06,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:06,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118973488] [2021-12-16 00:14:06,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:06,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:06,781 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:06,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390728573] [2021-12-16 00:14:06,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:06,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:06,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:06,786 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-16 00:14:06,789 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-16 00:14:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:06,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-16 00:14:06,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:06,993 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-16 00:14:06,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:07,130 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-16 00:14:07,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:07,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118973488] [2021-12-16 00:14:07,130 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:07,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390728573] [2021-12-16 00:14:07,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390728573] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:07,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:07,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2021-12-16 00:14:07,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955575943] [2021-12-16 00:14:07,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:07,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 00:14:07,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:07,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 00:14:07,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-16 00:14:07,134 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-16 00:14:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:07,382 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2021-12-16 00:14:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 00:14:07,383 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-16 00:14:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:07,384 INFO L225 Difference]: With dead ends: 41 [2021-12-16 00:14:07,384 INFO L226 Difference]: Without dead ends: 34 [2021-12-16 00:14:07,385 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-16 00:14:07,386 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:07,386 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.2s Time] [2021-12-16 00:14:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-16 00:14:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-12-16 00:14:07,392 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-16 00:14:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-12-16 00:14:07,393 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-12-16 00:14:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:07,394 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-12-16 00:14:07,394 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-16 00:14:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-12-16 00:14:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-16 00:14:07,396 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:07,396 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:07,416 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-16 00:14:07,605 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-16 00:14:07,605 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2021-12-16 00:14:07,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:07,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194581333] [2021-12-16 00:14:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:07,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:07,616 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:07,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488181832] [2021-12-16 00:14:07,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:07,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:07,618 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-16 00:14:07,621 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-16 00:14:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:07,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 00:14:07,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:07,725 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-16 00:14:07,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:07,787 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-16 00:14:07,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:07,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194581333] [2021-12-16 00:14:07,787 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:07,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488181832] [2021-12-16 00:14:07,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488181832] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:07,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:07,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-16 00:14:07,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578596098] [2021-12-16 00:14:07,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:07,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 00:14:07,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 00:14:07,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-16 00:14:07,790 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-16 00:14:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:07,866 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2021-12-16 00:14:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 00:14:07,866 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-16 00:14:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:07,867 INFO L225 Difference]: With dead ends: 73 [2021-12-16 00:14:07,867 INFO L226 Difference]: Without dead ends: 67 [2021-12-16 00:14:07,868 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-16 00:14:07,869 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-16 00:14:07,869 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-16 00:14:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-16 00:14:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2021-12-16 00:14:07,877 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-16 00:14:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-12-16 00:14:07,878 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2021-12-16 00:14:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:07,879 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-12-16 00:14:07,879 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-16 00:14:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-12-16 00:14:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 00:14:07,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:07,880 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:07,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-16 00:14:08,087 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-16 00:14:08,088 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:08,088 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2021-12-16 00:14:08,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:08,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784383664] [2021-12-16 00:14:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:08,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:08,097 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:08,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283990855] [2021-12-16 00:14:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:08,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:08,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:08,099 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-16 00:14:08,101 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-16 00:14:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:08,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-16 00:14:08,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:08,515 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-16 00:14:08,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:08,900 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-16 00:14:08,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:08,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784383664] [2021-12-16 00:14:08,901 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:08,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283990855] [2021-12-16 00:14:08,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283990855] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:08,901 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:08,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2021-12-16 00:14:08,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274225082] [2021-12-16 00:14:08,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:08,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-16 00:14:08,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:08,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-16 00:14:08,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-12-16 00:14:08,904 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-16 00:14:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:09,719 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-12-16 00:14:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-16 00:14:09,720 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-16 00:14:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:09,721 INFO L225 Difference]: With dead ends: 65 [2021-12-16 00:14:09,721 INFO L226 Difference]: Without dead ends: 57 [2021-12-16 00:14:09,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2021-12-16 00:14:09,723 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-16 00:14:09,723 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-16 00:14:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-16 00:14:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2021-12-16 00:14:09,731 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-16 00:14:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-12-16 00:14:09,732 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2021-12-16 00:14:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:09,732 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-12-16 00:14:09,733 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-16 00:14:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-12-16 00:14:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-16 00:14:09,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:09,734 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:09,756 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-16 00:14:09,943 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-16 00:14:09,943 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2021-12-16 00:14:09,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:09,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992032450] [2021-12-16 00:14:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:09,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:09,954 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:09,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339223911] [2021-12-16 00:14:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:09,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:09,968 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-16 00:14:09,974 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-16 00:14:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 00:14:10,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 00:14:10,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:10,143 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-16 00:14:10,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:10,301 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-16 00:14:10,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:10,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992032450] [2021-12-16 00:14:10,301 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:10,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339223911] [2021-12-16 00:14:10,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339223911] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:10,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:10,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-16 00:14:10,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820491091] [2021-12-16 00:14:10,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:10,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 00:14:10,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:10,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 00:14:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-16 00:14:10,303 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-16 00:14:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:10,490 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2021-12-16 00:14:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 00:14:10,491 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-16 00:14:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:10,496 INFO L225 Difference]: With dead ends: 116 [2021-12-16 00:14:10,496 INFO L226 Difference]: Without dead ends: 110 [2021-12-16 00:14:10,497 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-16 00:14:10,499 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-16 00:14:10,501 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-16 00:14:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-16 00:14:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-16 00:14:10,524 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-16 00:14:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-16 00:14:10,529 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2021-12-16 00:14:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:10,529 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-16 00:14:10,530 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-16 00:14:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-16 00:14:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-16 00:14:10,538 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:10,539 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 00:14:10,566 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-16 00:14:10,765 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-16 00:14:10,766 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:10,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2021-12-16 00:14:10,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:10,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623590071] [2021-12-16 00:14:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:10,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:10,780 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:10,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2144376896] [2021-12-16 00:14:10,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 00:14:10,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:10,781 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-16 00:14:10,783 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-16 00:14:10,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 00:14:10,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 00:14:10,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-16 00:14:10,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 00:14:11,941 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-16 00:14:11,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 00:14:14,433 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-16 00:14:14,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 00:14:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623590071] [2021-12-16 00:14:14,434 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 00:14:14,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144376896] [2021-12-16 00:14:14,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144376896] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 00:14:14,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 00:14:14,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 48 [2021-12-16 00:14:14,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368203178] [2021-12-16 00:14:14,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 00:14:14,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-16 00:14:14,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 00:14:14,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-16 00:14:14,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1941, Unknown=0, NotChecked=0, Total=2256 [2021-12-16 00:14:14,437 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-16 00:14:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 00:14:16,204 INFO L93 Difference]: Finished difference Result 220 states and 244 transitions. [2021-12-16 00:14:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-16 00:14:16,205 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-16 00:14:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 00:14:16,207 INFO L225 Difference]: With dead ends: 220 [2021-12-16 00:14:16,207 INFO L226 Difference]: Without dead ends: 212 [2021-12-16 00:14:16,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=568, Invalid=3338, Unknown=0, NotChecked=0, Total=3906 [2021-12-16 00:14:16,211 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 86 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2021-12-16 00:14:16,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 853 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-16 00:14:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-16 00:14:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2021-12-16 00:14:16,236 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-16 00:14:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2021-12-16 00:14:16,241 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 219 transitions. Word has length 109 [2021-12-16 00:14:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 00:14:16,242 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 219 transitions. [2021-12-16 00:14:16,244 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-16 00:14:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2021-12-16 00:14:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-16 00:14:16,249 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 00:14:16,249 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-16 00:14:16,277 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-16 00:14:16,462 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-16 00:14:16,463 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-16 00:14:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 00:14:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash 977369872, now seen corresponding path program 1 times [2021-12-16 00:14:16,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 00:14:16,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112404222] [2021-12-16 00:14:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:16,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 00:14:16,474 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 00:14:16,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [153244753] [2021-12-16 00:14:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 00:14:16,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 00:14:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 00:14:16,483 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-16 00:14:16,484 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-16 00:14:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 00:14:16,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 00:14:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 00:14:16,631 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 00:14:16,631 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-16 00:14:16,632 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-16 00:14:16,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 00:14:16,871 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-16 00:14:16,874 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2021-12-16 00:14:16,877 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-16 00:14:16,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:14:16 BoogieIcfgContainer [2021-12-16 00:14:16,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-16 00:14:16,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 00:14:16,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 00:14:16,934 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 00:14:16,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:14:05" (3/4) ... [2021-12-16 00:14:16,936 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-16 00:14:16,998 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 00:14:16,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 00:14:16,999 INFO L158 Benchmark]: Toolchain (without parser) took 11814.93ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 75.1MB in the beginning and 76.5MB in the end (delta: -1.4MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2021-12-16 00:14:16,999 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 102.8MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 00:14:16,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.32ms. Allocated memory is still 102.8MB. Free memory was 74.9MB in the beginning and 79.8MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-16 00:14:17,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.85ms. Allocated memory is still 102.8MB. Free memory was 79.8MB in the beginning and 78.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 00:14:17,000 INFO L158 Benchmark]: Boogie Preprocessor took 17.25ms. Allocated memory is still 102.8MB. Free memory was 78.2MB in the beginning and 77.4MB in the end (delta: 841.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 00:14:17,000 INFO L158 Benchmark]: RCFGBuilder took 305.67ms. Allocated memory is still 102.8MB. Free memory was 77.4MB in the beginning and 67.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 00:14:17,001 INFO L158 Benchmark]: TraceAbstraction took 11137.44ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 67.3MB in the beginning and 82.8MB in the end (delta: -15.5MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2021-12-16 00:14:17,001 INFO L158 Benchmark]: Witness Printer took 65.03ms. Allocated memory is still 148.9MB. Free memory was 82.8MB in the beginning and 76.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 00:14:17,003 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.34ms. Allocated memory is still 102.8MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.32ms. Allocated memory is still 102.8MB. Free memory was 74.9MB in the beginning and 79.8MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.85ms. Allocated memory is still 102.8MB. Free memory was 79.8MB in the beginning and 78.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.25ms. Allocated memory is still 102.8MB. Free memory was 78.2MB in the beginning and 77.4MB in the end (delta: 841.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 305.67ms. Allocated memory is still 102.8MB. Free memory was 77.4MB in the beginning and 67.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11137.44ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 67.3MB in the beginning and 82.8MB in the end (delta: -15.5MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Witness Printer took 65.03ms. Allocated memory is still 148.9MB. Free memory was 82.8MB in the beginning and 76.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=0, X=37, Y=2, y=0] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-33, X=37, x=0, y=0, Y=2] [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=37, x=0, 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=0, X=37, x=0, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-33, x=0, x=0, x=0, X=37, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-29, X=37, x=0, x=0, x=0, y=0, Y=2] [L45] x++ VAL [counter=1, v=-29, X=37, x=0, x=1, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-29, x=0, x=1, x=0, 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=2, v=-29, x=1, X=37, x=0, x=2, 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=1, X=37, x=0, x=2, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-29, x=1, x=2, x=0, X=37, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-25, x=2, x=1, X=37, x=0, y=0, Y=2] [L45] x++ VAL [counter=2, v=-25, x=2, x=2, X=37, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-25, x=0, X=37, x=2, x=2, 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=37, x=0, x=4, x=2, y=0, Y=2] [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=37, x=0, 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=0, x=2, x=4, X=37, y=0, Y=2] [L45] x++ VAL [counter=3, v=-21, x=0, X=37, x=4, x=3, y=0, Y=2] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-21, x=4, x=3, 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=4, v=-21, x=6, X=37, x=0, x=3, y=0, Y=2] [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=37, x=6, x=0, x=3, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-21, x=0, x=6, X=37, x=3, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-17, X=37, x=6, x=0, x=3, y=0, Y=2] [L45] x++ VAL [counter=4, v=-17, X=37, x=6, x=0, x=4, y=0, Y=2] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-17, x=6, x=4, 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=5, v=-17, x=0, x=8, X=37, x=4, 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=4, X=37, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-17, X=37, x=8, x=4, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-13, x=8, X=37, x=0, x=4, Y=2, y=0] [L45] x++ VAL [counter=5, v=-13, x=0, x=5, x=8, X=37, Y=2, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-13, x=5, x=8, x=0, 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=6, v=-13, X=37, x=5, x=10, 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=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=10, x=5, x=0, X=37, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-13, x=10, X=37, x=0, x=5, Y=2, y=0] [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=0, Y=2] [L45] x++ VAL [counter=6, v=-9, X=37, x=6, x=0, x=10, y=0, Y=2] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-9, x=10, X=37, x=0, x=6, y=0, Y=2] [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=6, x=12, 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=12, x=0, x=6, X=37, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-9, x=6, x=0, x=12, X=37, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-5, X=37, x=0, x=6, x=12, Y=2, y=0] [L45] x++ VAL [counter=7, v=-5, x=12, X=37, x=7, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-5, x=0, X=37, x=7, x=12, 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=14, x=7, x=0, X=37, y=0, Y=2] [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=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-5, x=7, x=14, x=0, X=37, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-1, X=37, x=14, x=0, x=7, y=0, Y=2] [L45] x++ VAL [counter=8, v=-1, x=0, x=14, x=8, X=37, Y=2, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-1, x=0, x=14, X=37, x=8, y=0, Y=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-1, x=16, X=37, x=8, 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=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=0, x=8, X=37, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-1, x=8, x=0, X=37, x=16, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=3, x=16, X=37, x=0, x=8, Y=2, y=0] [L45] x++ VAL [counter=9, v=3, x=0, x=16, X=37, x=9, y=0, Y=2] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=3, x=9, x=16, X=37, x=0, 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=9, x=18, X=37, 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=37, x=9, x=0, x=18, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=3, X=37, x=18, x=9, x=0, Y=2, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=10, v=-67, x=9, x=18, x=0, X=37, y=1, Y=2] [L45] x++ VAL [counter=10, v=-67, X=37, x=0, x=18, x=10, y=1, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-67, x=10, x=0, x=18, X=37, y=1, Y=2] [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: 11.0s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 1393 SdHoareTripleChecker+Invalid, 1.4s 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, 336 SyntacticMatches, 4 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 4.5s 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.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 3396 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-16 00:14:17,034 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