./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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_unwindbound50.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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 03:07:12,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 03:07:12,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 03:07:12,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 03:07:12,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 03:07:12,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 03:07:12,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 03:07:12,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 03:07:12,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 03:07:12,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 03:07:12,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 03:07:12,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 03:07:12,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 03:07:12,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 03:07:12,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 03:07:12,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 03:07:12,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 03:07:12,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 03:07:12,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 03:07:12,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 03:07:12,294 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 03:07:12,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 03:07:12,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 03:07:12,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 03:07:12,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 03:07:12,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 03:07:12,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 03:07:12,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 03:07:12,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 03:07:12,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 03:07:12,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 03:07:12,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 03:07:12,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 03:07:12,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 03:07:12,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 03:07:12,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 03:07:12,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 03:07:12,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 03:07:12,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 03:07:12,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 03:07:12,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 03:07:12,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 03:07:12,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 03:07:12,338 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 03:07:12,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 03:07:12,339 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 03:07:12,339 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 03:07:12,340 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 03:07:12,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 03:07:12,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 03:07:12,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 03:07:12,341 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 03:07:12,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 03:07:12,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 03:07:12,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 03:07:12,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 03:07:12,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 03:07:12,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 03:07:12,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 03:07:12,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 03:07:12,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 03:07:12,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 03:07:12,343 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 03:07:12,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 03:07:12,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 03:07:12,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 03:07:12,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 03:07:12,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:07:12,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 03:07:12,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 03:07:12,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 03:07:12,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 03:07:12,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 03:07:12,344 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 03:07:12,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 03:07:12,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 03:07:12,345 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2022-07-21 03:07:12,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 03:07:12,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 03:07:12,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 03:07:12,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 03:07:12,606 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 03:07:12,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-07-21 03:07:12,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fb752ef/110dc47abe3f4ff6956c137e58e44c66/FLAG4c839c2a0 [2022-07-21 03:07:12,964 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 03:07:12,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-07-21 03:07:12,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fb752ef/110dc47abe3f4ff6956c137e58e44c66/FLAG4c839c2a0 [2022-07-21 03:07:13,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7fb752ef/110dc47abe3f4ff6956c137e58e44c66 [2022-07-21 03:07:13,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 03:07:13,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 03:07:13,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 03:07:13,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 03:07:13,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 03:07:13,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401a1ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13, skipping insertion in model container [2022-07-21 03:07:13,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 03:07:13,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 03:07:13,503 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_unwindbound50.c[597,610] [2022-07-21 03:07:13,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:07:13,536 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 03:07:13,597 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_unwindbound50.c[597,610] [2022-07-21 03:07:13,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:07:13,624 INFO L208 MainTranslator]: Completed translation [2022-07-21 03:07:13,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13 WrapperNode [2022-07-21 03:07:13,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 03:07:13,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 03:07:13,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 03:07:13,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 03:07:13,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,650 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-07-21 03:07:13,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 03:07:13,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 03:07:13,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 03:07:13,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 03:07:13,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 03:07:13,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 03:07:13,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 03:07:13,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 03:07:13,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (1/1) ... [2022-07-21 03:07:13,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:07:13,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:13,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 03:07:13,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 03:07:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 03:07:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 03:07:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 03:07:13,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 03:07:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 03:07:13,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 03:07:13,775 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 03:07:13,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 03:07:13,903 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 03:07:13,907 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 03:07:13,908 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 03:07:13,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:07:13 BoogieIcfgContainer [2022-07-21 03:07:13,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 03:07:13,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 03:07:13,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 03:07:13,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 03:07:13,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:07:13" (1/3) ... [2022-07-21 03:07:13,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dac65c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:07:13, skipping insertion in model container [2022-07-21 03:07:13,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:07:13" (2/3) ... [2022-07-21 03:07:13,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dac65c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:07:13, skipping insertion in model container [2022-07-21 03:07:13,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:07:13" (3/3) ... [2022-07-21 03:07:13,914 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-07-21 03:07:13,938 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 03:07:13,939 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 03:07:14,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 03:07:14,011 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a4eefca, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c7fcaa7 [2022-07-21 03:07:14,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 03:07:14,022 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) [2022-07-21 03:07:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 03:07:14,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:07:14,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:07:14,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:07:14,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:07:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2022-07-21 03:07:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:07:14,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823594473] [2022-07-21 03:07:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:07:14,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:07:14,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939224374] [2022-07-21 03:07:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:14,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:14,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:14,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:07:14,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 03:07:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:07:14,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 03:07:14,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:07:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:07:14,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:07:14,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:07:14,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823594473] [2022-07-21 03:07:14,318 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:07:14,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939224374] [2022-07-21 03:07:14,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939224374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:07:14,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:07:14,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 03:07:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492799124] [2022-07-21 03:07:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:07:14,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 03:07:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:07:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 03:07:14,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 03:07:14,350 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) [2022-07-21 03:07:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:07:14,432 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-07-21 03:07:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 03:07:14,433 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 [2022-07-21 03:07:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:07:14,438 INFO L225 Difference]: With dead ends: 54 [2022-07-21 03:07:14,438 INFO L226 Difference]: Without dead ends: 25 [2022-07-21 03:07:14,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:07:14,443 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 03:07:14,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:07:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-21 03:07:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-21 03:07:14,480 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) [2022-07-21 03:07:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-21 03:07:14,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2022-07-21 03:07:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:07:14,482 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-21 03:07:14,482 INFO L496 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) [2022-07-21 03:07:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-21 03:07:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 03:07:14,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:07:14,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:07:14,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 03:07:14,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-21 03:07:14,688 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:07:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:07:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2022-07-21 03:07:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:07:14,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356202521] [2022-07-21 03:07:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:07:14,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:07:14,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969365863] [2022-07-21 03:07:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:14,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:14,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:14,701 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) [2022-07-21 03:07:14,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 03:07:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:07:14,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 03:07:14,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:07:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:07:14,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:07:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 03:07:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:07:14,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356202521] [2022-07-21 03:07:14,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:07:14,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969365863] [2022-07-21 03:07:14,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969365863] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:07:14,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:07:14,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-07-21 03:07:14,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612282207] [2022-07-21 03:07:14,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:07:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 03:07:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:07:14,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 03:07:14,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-21 03:07:14,918 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) [2022-07-21 03:07:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:07:15,105 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-07-21 03:07:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 03:07:15,105 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 [2022-07-21 03:07:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:07:15,106 INFO L225 Difference]: With dead ends: 41 [2022-07-21 03:07:15,106 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 03:07:15,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-21 03:07:15,108 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:07:15,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 64 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:07:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 03:07:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-21 03:07:15,113 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) [2022-07-21 03:07:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-07-21 03:07:15,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-07-21 03:07:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:07:15,114 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-07-21 03:07:15,114 INFO L496 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) [2022-07-21 03:07:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-07-21 03:07:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 03:07:15,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:07:15,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:07:15,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 03:07:15,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-21 03:07:15,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:07:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:07:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2022-07-21 03:07:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:07:15,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521869857] [2022-07-21 03:07:15,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:07:15,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:07:15,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072141521] [2022-07-21 03:07:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:15,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:15,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:15,329 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) [2022-07-21 03:07:15,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 03:07:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:07:15,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 03:07:15,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:07:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:07:15,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:07:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:07:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:07:15,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521869857] [2022-07-21 03:07:15,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:07:15,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072141521] [2022-07-21 03:07:15,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072141521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:07:15,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:07:15,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-21 03:07:15,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822847652] [2022-07-21 03:07:15,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:07:15,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 03:07:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:07:15,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 03:07:15,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 03:07:15,437 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) [2022-07-21 03:07:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:07:15,485 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-07-21 03:07:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 03:07:15,486 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 [2022-07-21 03:07:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:07:15,487 INFO L225 Difference]: With dead ends: 73 [2022-07-21 03:07:15,487 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 03:07:15,487 INFO L412 NwaCegarLoop]: 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 [2022-07-21 03:07:15,488 INFO L413 NwaCegarLoop]: 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 [2022-07-21 03:07:15,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 03:07:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 03:07:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-07-21 03:07:15,497 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) [2022-07-21 03:07:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-21 03:07:15,498 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2022-07-21 03:07:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:07:15,499 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-21 03:07:15,499 INFO L496 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) [2022-07-21 03:07:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-21 03:07:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 03:07:15,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:07:15,500 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:07:15,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 03:07:15,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:15,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:07:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:07:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2022-07-21 03:07:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:07:15,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492837109] [2022-07-21 03:07:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:07:15,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:07:15,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [996093947] [2022-07-21 03:07:15,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:15,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:15,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:15,717 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) [2022-07-21 03:07:15,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 03:07:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:07:15,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 03:07:15,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:07:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 03:07:15,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:07:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 03:07:16,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:07:16,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492837109] [2022-07-21 03:07:16,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:07:16,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996093947] [2022-07-21 03:07:16,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996093947] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:07:16,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:07:16,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-07-21 03:07:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159357864] [2022-07-21 03:07:16,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:07:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 03:07:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:07:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 03:07:16,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-21 03:07:16,275 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) [2022-07-21 03:07:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:07:16,744 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-07-21 03:07:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 03:07:16,744 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 [2022-07-21 03:07:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:07:16,745 INFO L225 Difference]: With dead ends: 81 [2022-07-21 03:07:16,745 INFO L226 Difference]: Without dead ends: 73 [2022-07-21 03:07:16,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 03:07:16,746 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:07:16,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 106 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 271 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2022-07-21 03:07:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-21 03:07:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-07-21 03:07:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 03:07:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-07-21 03:07:16,769 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 25 [2022-07-21 03:07:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:07:16,772 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-07-21 03:07:16,772 INFO L496 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) [2022-07-21 03:07:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-07-21 03:07:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 03:07:16,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:07:16,773 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:07:16,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 03:07:16,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:16,974 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:07:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:07:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2021783820, now seen corresponding path program 1 times [2022-07-21 03:07:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:07:16,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435821912] [2022-07-21 03:07:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:07:16,989 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:07:16,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287895992] [2022-07-21 03:07:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:16,991 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) [2022-07-21 03:07:16,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 03:07:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:07:17,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-21 03:07:17,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:07:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 03:07:24,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:07:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 03:07:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:07:25,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435821912] [2022-07-21 03:07:25,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:07:25,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287895992] [2022-07-21 03:07:25,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287895992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:07:25,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:07:25,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-07-21 03:07:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553338395] [2022-07-21 03:07:25,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:07:25,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 03:07:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:07:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 03:07:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2022-07-21 03:07:25,035 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:07:27,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:07:31,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:07:33,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:07:35,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:07:37,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:07:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:07:39,331 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-07-21 03:07:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 03:07:39,331 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-07-21 03:07:39,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:07:39,332 INFO L225 Difference]: With dead ends: 92 [2022-07-21 03:07:39,332 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 03:07:39,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=66, Invalid=237, Unknown=3, NotChecked=0, Total=306 [2022-07-21 03:07:39,333 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 13 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:07:39,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 59 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 10.1s Time] [2022-07-21 03:07:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 03:07:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-07-21 03:07:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-21 03:07:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2022-07-21 03:07:39,344 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 35 [2022-07-21 03:07:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:07:39,350 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2022-07-21 03:07:39,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:07:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-07-21 03:07:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-21 03:07:39,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:07:39,351 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:07:39,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 03:07:39,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:39,562 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:07:39,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:07:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2132634866, now seen corresponding path program 1 times [2022-07-21 03:07:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:07:39,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134705769] [2022-07-21 03:07:39,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:07:39,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:07:39,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960711620] [2022-07-21 03:07:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:39,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:39,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:39,572 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) [2022-07-21 03:07:39,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 03:07:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:07:39,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 03:07:39,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:07:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 03:07:39,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:07:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 03:07:39,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:07:39,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134705769] [2022-07-21 03:07:39,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:07:39,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960711620] [2022-07-21 03:07:39,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960711620] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:07:39,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:07:39,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-21 03:07:39,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126855062] [2022-07-21 03:07:39,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:07:39,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 03:07:39,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:07:39,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 03:07:39,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-21 03:07:39,858 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 03:07:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:07:40,008 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-07-21 03:07:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 03:07:40,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 35 [2022-07-21 03:07:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:07:40,009 INFO L225 Difference]: With dead ends: 93 [2022-07-21 03:07:40,009 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 03:07:40,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-21 03:07:40,010 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:07:40,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:07:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 03:07:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2022-07-21 03:07:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 03:07:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2022-07-21 03:07:40,019 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 35 [2022-07-21 03:07:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:07:40,019 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2022-07-21 03:07:40,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 03:07:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2022-07-21 03:07:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 03:07:40,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:07:40,021 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:07:40,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 03:07:40,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:40,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:07:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:07:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1410392757, now seen corresponding path program 2 times [2022-07-21 03:07:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:07:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009463296] [2022-07-21 03:07:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:07:40,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:07:40,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881018258] [2022-07-21 03:07:40,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:07:40,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:40,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:40,248 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) [2022-07-21 03:07:40,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 03:07:40,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:07:40,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:07:40,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 03:07:40,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:07:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 03:07:40,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:07:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 03:07:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:07:40,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009463296] [2022-07-21 03:07:40,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:07:40,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881018258] [2022-07-21 03:07:40,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881018258] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:07:40,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:07:40,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-21 03:07:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725157784] [2022-07-21 03:07:40,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:07:40,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 03:07:40,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:07:40,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 03:07:40,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-07-21 03:07:40,510 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 03:07:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:07:40,656 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-07-21 03:07:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 03:07:40,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 45 [2022-07-21 03:07:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:07:40,657 INFO L225 Difference]: With dead ends: 104 [2022-07-21 03:07:40,658 INFO L226 Difference]: Without dead ends: 98 [2022-07-21 03:07:40,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-21 03:07:40,658 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:07:40,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:07:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-21 03:07:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-07-21 03:07:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 70 states have internal predecessors, (82), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-21 03:07:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2022-07-21 03:07:40,668 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 45 [2022-07-21 03:07:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:07:40,668 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2022-07-21 03:07:40,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 03:07:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2022-07-21 03:07:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 03:07:40,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:07:40,670 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:07:40,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 03:07:40,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:40,876 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:07:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:07:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1900020427, now seen corresponding path program 3 times [2022-07-21 03:07:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:07:40,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856961403] [2022-07-21 03:07:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:07:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:07:40,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:07:40,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991654211] [2022-07-21 03:07:40,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:07:40,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:07:40,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:07:40,898 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:07:40,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 03:07:41,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-21 03:07:41,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:07:42,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 03:07:42,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:07:47,465 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~X~0#1| 1)) (.cse5 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~y~0#1| (- 2) |c_ULTIMATE.start_main_~X~0#1|)) 2) 0)) (.cse3 (+ (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~X~0#1|) (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) (- 2))))) (or (and (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1| 0))) (or (let ((.cse0 (div |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse0)) (= (mod |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|) 0) (<= .cse0 .cse1) (not (<= .cse0 |c_ULTIMATE.start_main_~X~0#1|)) (not .cse2))) (and (= |c_ULTIMATE.start_main_~xy~0#1| 0) (= |c_ULTIMATE.start_main_~yx~0#1| 0) .cse2))) (= .cse3 0) .cse4 .cse5) (let ((.cse6 (div .cse3 |c_ULTIMATE.start_main_~Y~0#1|))) (and (<= .cse6 .cse1) (not .cse5) (= |c_ULTIMATE.start_main_~xy~0#1| (* |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse6)) (not (<= .cse6 |c_ULTIMATE.start_main_~X~0#1|)) .cse4 (= (mod .cse3 |c_ULTIMATE.start_main_~Y~0#1|) 0))))) is different from false [2022-07-21 03:09:12,975 WARN L833 $PredicateComparison]: unable to prove that (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141| Int) (|aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| Int)) (let ((.cse0 (* 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse11 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2))) (let ((.cse2 (+ .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse5 (+ (* (- 1) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (* (- 1) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) .cse0)) (.cse6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse9 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse4 (+ (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse7 (* (- 1) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|)) (.cse8 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (.cse1 (+ (* |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| 2) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse3 (+ 2 .cse0))) (and (<= .cse0 .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (< |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| 2) (< .cse2 .cse3) (<= .cse0 .cse4) (<= .cse0 .cse2) (= (mod (+ |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (- 2) .cse5)) 2) 0) (not (= |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 0)) (<= (+ (div (+ .cse6 .cse7 .cse8 .cse9 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) (+ .cse0 1)) (= (mod (+ |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse5) .cse7) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) 0) (< .cse0 (+ (div (+ .cse6 |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| .cse7 .cse8 .cse9) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (< .cse4 .cse3) (not (let ((.cse12 (* (- 2) |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) (let ((.cse10 (div (+ .cse7 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| .cse8 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2) (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (+ .cse12 .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|))) (= (+ (* (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse10) 2) .cse11) (+ .cse12 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 2) (* 2 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| .cse10)) .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2)))))) (< .cse1 .cse3))))))) is different from false [2022-07-21 03:10:33,073 WARN L833 $PredicateComparison]: unable to prove that (or (<= 1 c___VERIFIER_assert_~cond) (and (<= 0 c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141| Int) (|aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| Int)) (let ((.cse0 (* 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse11 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2))) (let ((.cse2 (+ .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse5 (+ (* (- 1) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (* (- 1) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) .cse0)) (.cse6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse9 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse4 (+ (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse7 (* (- 1) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|)) (.cse8 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (.cse1 (+ (* |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| 2) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse3 (+ 2 .cse0))) (and (<= .cse0 .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (< |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| 2) (< .cse2 .cse3) (<= .cse0 .cse4) (<= .cse0 .cse2) (= (mod (+ |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (- 2) .cse5)) 2) 0) (not (= |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 0)) (<= (+ (div (+ .cse6 .cse7 .cse8 .cse9 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) (+ .cse0 1)) (= (mod (+ |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse5) .cse7) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) 0) (< .cse0 (+ (div (+ .cse6 |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| .cse7 .cse8 .cse9) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (< .cse4 .cse3) (not (let ((.cse12 (* (- 2) |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) (let ((.cse10 (div (+ .cse7 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| .cse8 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2) (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (+ .cse12 .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|))) (= (+ (* (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse10) 2) .cse11) (+ .cse12 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 2) (* 2 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| .cse10)) .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2)))))) (< .cse1 .cse3))))))) is different from false [2022-07-21 03:11:16,257 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141| Int) (|aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| Int)) (let ((.cse0 (* 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse11 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2))) (let ((.cse2 (+ .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse5 (+ (* (- 1) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (* (- 1) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) .cse0)) (.cse6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse9 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse4 (+ (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse7 (* (- 1) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|)) (.cse8 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (.cse1 (+ (* |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| 2) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse3 (+ 2 .cse0))) (and (<= .cse0 .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (< |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| 2) (< .cse2 .cse3) (<= .cse0 .cse4) (<= .cse0 .cse2) (= (mod (+ |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (- 2) .cse5)) 2) 0) (not (= |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 0)) (<= (+ (div (+ .cse6 .cse7 .cse8 .cse9 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) (+ .cse0 1)) (= (mod (+ |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse5) .cse7) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) 0) (< .cse0 (+ (div (+ .cse6 |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| .cse7 .cse8 .cse9) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (< .cse4 .cse3) (not (let ((.cse12 (* (- 2) |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) (let ((.cse10 (div (+ .cse7 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| .cse8 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2) (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (+ .cse12 .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|))) (= (+ (* (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse10) 2) .cse11) (+ .cse12 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 2) (* 2 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| .cse10)) .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2)))))) (< .cse1 .cse3))))) is different from false [2022-07-21 03:11:18,262 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| Int) (|v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141| Int) (|aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| Int)) (let ((.cse0 (* 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse11 (* |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2))) (let ((.cse2 (+ .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse5 (+ (* (- 1) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (* (- 1) |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) .cse0)) (.cse6 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse9 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse4 (+ (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse7 (* (- 1) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|)) (.cse8 (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (.cse1 (+ (* |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| 2) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|)) (.cse3 (+ 2 .cse0))) (and (<= .cse0 .cse1) (<= 0 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|) (< |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| 2) (< .cse2 .cse3) (<= .cse0 .cse4) (<= .cse0 .cse2) (= (mod (+ |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (- 2) .cse5)) 2) 0) (not (= |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 0)) (<= (+ (div (+ .cse6 .cse7 .cse8 .cse9 |aux_div_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141|) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|) (+ .cse0 1)) (= (mod (+ |aux_div_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse5) .cse7) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) 0) (< .cse0 (+ (div (+ .cse6 |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| .cse7 .cse8 .cse9) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|) |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| |v_ULTIMATE.start_main_~v~0#1_BEFORE_CALL_17|)) (< .cse4 .cse3) (not (let ((.cse12 (* (- 2) |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) (let ((.cse10 (div (+ .cse7 |aux_div_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| .cse8 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| |aux_div_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165| 2) (* (- 1) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| (+ .cse12 .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189|))) |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16|))) (= (+ (* (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| .cse10) 2) .cse11) (+ .cse12 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| 2) (* 2 (* |v_ULTIMATE.start_main_~Y~0#1_BEFORE_CALL_16| .cse10)) .cse11 |aux_mod_aux_mod_aux_mod_aux_mod_v_ULTIMATE.start_main_~X~0#1_BEFORE_CALL_26_127_141_165_189| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_15| 2)))))) (< .cse1 .cse3))))) is different from true [2022-07-21 03:11:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 1 not checked. [2022-07-21 03:11:18,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:11:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-21 03:11:18,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:11:18,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856961403] [2022-07-21 03:11:18,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:11:18,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991654211] [2022-07-21 03:11:18,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991654211] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:11:18,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:11:18,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2022-07-21 03:11:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167090307] [2022-07-21 03:11:18,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:11:18,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 03:11:18,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:11:18,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 03:11:18,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=198, Unknown=5, NotChecked=124, Total=380 [2022-07-21 03:11:18,403 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 20 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:11:20,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~X~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~X~0#1|)) (.cse8 (* |c_ULTIMATE.start_main_~Y~0#1| 2))) (and (let ((.cse5 (= |c_ULTIMATE.start_main_~Y~0#1| 0)) (.cse4 (= (mod (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~y~0#1| (- 2) |c_ULTIMATE.start_main_~X~0#1|)) 2) 0)) (.cse3 (+ (* (- 1) |c_ULTIMATE.start_main_~Y~0#1|) .cse7 (div (+ (* (- 1) |c_ULTIMATE.start_main_~v~0#1|) (* (- 1) |c_ULTIMATE.start_main_~X~0#1|)) (- 2))))) (or (and (let ((.cse2 (= |c_ULTIMATE.start_main_~y~0#1| 0))) (or (let ((.cse0 (div |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (and (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse0)) (= (mod |c_ULTIMATE.start_main_~xy~0#1| |c_ULTIMATE.start_main_~y~0#1|) 0) (<= .cse0 .cse1) (not (<= .cse0 |c_ULTIMATE.start_main_~X~0#1|)) (not .cse2))) (and (= |c_ULTIMATE.start_main_~xy~0#1| 0) (= |c_ULTIMATE.start_main_~yx~0#1| 0) .cse2))) (= .cse3 0) .cse4 .cse5) (let ((.cse6 (div .cse3 |c_ULTIMATE.start_main_~Y~0#1|))) (and (<= .cse6 .cse1) (not .cse5) (= |c_ULTIMATE.start_main_~xy~0#1| (* |c_ULTIMATE.start_main_~y~0#1| .cse6)) (= |c_ULTIMATE.start_main_~yx~0#1| (* |c_ULTIMATE.start_main_~Y~0#1| .cse6)) (not (<= .cse6 |c_ULTIMATE.start_main_~X~0#1|)) .cse4 (= (mod .cse3 |c_ULTIMATE.start_main_~Y~0#1|) 0))))) (<= |c_ULTIMATE.start_main_~x~0#1| .cse1) (not (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~X~0#1|)) (= (+ |c_ULTIMATE.start_main_~X~0#1| (* 2 .cse7) |c_ULTIMATE.start_main_~v~0#1|) (+ .cse8 (* 2 (* |c_ULTIMATE.start_main_~Y~0#1| |c_ULTIMATE.start_main_~x~0#1|)))) (= (+ |c_ULTIMATE.start_main_~X~0#1| |c_ULTIMATE.start_main_~v~0#1| (* |c_ULTIMATE.start_main_~xy~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~yx~0#1| 2) .cse8)))) is different from false [2022-07-21 03:11:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:11:22,781 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2022-07-21 03:11:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 03:11:22,782 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2022-07-21 03:11:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:11:22,783 INFO L225 Difference]: With dead ends: 93 [2022-07-21 03:11:22,783 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 03:11:22,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=116, Invalid=450, Unknown=6, NotChecked=240, Total=812 [2022-07-21 03:11:22,784 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:11:22,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 185 Invalid, 0 Unknown, 103 Unchecked, 0.2s Time] [2022-07-21 03:11:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 03:11:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 50. [2022-07-21 03:11:22,790 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) [2022-07-21 03:11:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-07-21 03:11:22,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 45 [2022-07-21 03:11:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:11:22,791 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-07-21 03:11:22,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 03:11:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-07-21 03:11:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 03:11:22,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:11:22,792 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:11:22,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 03:11:22,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-21 03:11:23,000 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:11:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:11:23,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2022-07-21 03:11:23,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:11:23,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765858751] [2022-07-21 03:11:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:11:23,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:11:23,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886434961] [2022-07-21 03:11:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:23,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:23,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:11:23,008 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:11:23,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 03:11:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:11:23,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 03:11:23,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:11:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:11:23,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:11:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 03:11:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:11:23,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765858751] [2022-07-21 03:11:23,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:11:23,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886434961] [2022-07-21 03:11:23,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886434961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:11:23,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:11:23,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-21 03:11:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428263112] [2022-07-21 03:11:23,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:11:23,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 03:11:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:11:23,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 03:11:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-21 03:11:23,181 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) [2022-07-21 03:11:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:11:23,318 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-07-21 03:11:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 03:11:23,319 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 [2022-07-21 03:11:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:11:23,319 INFO L225 Difference]: With dead ends: 116 [2022-07-21 03:11:23,320 INFO L226 Difference]: Without dead ends: 110 [2022-07-21 03:11:23,320 INFO L412 NwaCegarLoop]: 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 [2022-07-21 03:11:23,320 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 90 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:11:23,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 131 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:11:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-21 03:11:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-07-21 03:11:23,336 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) [2022-07-21 03:11:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-07-21 03:11:23,338 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2022-07-21 03:11:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:11:23,339 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-07-21 03:11:23,339 INFO L496 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) [2022-07-21 03:11:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-07-21 03:11:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 03:11:23,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:11:23,345 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:11:23,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 03:11:23,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:23,559 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:11:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:11:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2022-07-21 03:11:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:11:23,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162596610] [2022-07-21 03:11:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:11:23,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:11:23,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1505305994] [2022-07-21 03:11:23,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:11:23,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:23,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:11:23,573 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:11:23,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 03:11:23,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:11:23,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:11:23,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 03:11:23,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:11:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:11:23,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:11:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-21 03:11:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:11:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162596610] [2022-07-21 03:11:23,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:11:23,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505305994] [2022-07-21 03:11:23,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505305994] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:11:23,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:11:23,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-21 03:11:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912673576] [2022-07-21 03:11:23,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:11:23,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 03:11:23,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:11:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 03:11:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-07-21 03:11:23,992 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-21 03:11:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:11:24,369 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-07-21 03:11:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-21 03:11:24,369 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 109 [2022-07-21 03:11:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:11:24,373 INFO L225 Difference]: With dead ends: 236 [2022-07-21 03:11:24,373 INFO L226 Difference]: Without dead ends: 230 [2022-07-21 03:11:24,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-07-21 03:11:24,374 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 214 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 03:11:24,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 292 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 03:11:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-21 03:11:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-07-21 03:11:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 184 states have (on average 1.125) internal successors, (207), 184 states have internal predecessors, (207), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-21 03:11:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2022-07-21 03:11:24,403 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2022-07-21 03:11:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:11:24,404 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2022-07-21 03:11:24,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.576923076923077) internal successors, (145), 26 states have internal predecessors, (145), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-21 03:11:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2022-07-21 03:11:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-21 03:11:24,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:11:24,408 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:11:24,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 03:11:24,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 03:11:24,615 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:11:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:11:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2022-07-21 03:11:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:11:24,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744731944] [2022-07-21 03:11:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:11:24,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:11:24,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594919146] [2022-07-21 03:11:24,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:11:24,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:24,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:11:24,627 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:11:24,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 03:11:24,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-21 03:11:24,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:11:24,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 03:11:24,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:11:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-07-21 03:11:26,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:11:27,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:11:27,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744731944] [2022-07-21 03:11:27,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:11:27,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594919146] [2022-07-21 03:11:27,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594919146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 03:11:27,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-07-21 03:11:27,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-07-21 03:11:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299089551] [2022-07-21 03:11:27,004 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-07-21 03:11:27,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 03:11:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:11:27,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 03:11:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2022-07-21 03:11:27,005 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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) [2022-07-21 03:11:29,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:11:33,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:11:35,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-07-21 03:11:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:11:37,440 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2022-07-21 03:11:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 03:11:37,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 229 [2022-07-21 03:11:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:11:37,442 INFO L225 Difference]: With dead ends: 449 [2022-07-21 03:11:37,442 INFO L226 Difference]: Without dead ends: 443 [2022-07-21 03:11:37,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=94, Invalid=409, Unknown=3, NotChecked=0, Total=506 [2022-07-21 03:11:37,444 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:11:37,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 03:11:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-07-21 03:11:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2022-07-21 03:11:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 352 states have (on average 1.125) internal successors, (396), 352 states have internal predecessors, (396), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-07-21 03:11:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2022-07-21 03:11:37,475 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2022-07-21 03:11:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:11:37,476 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2022-07-21 03:11:37,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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) [2022-07-21 03:11:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2022-07-21 03:11:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-21 03:11:37,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:11:37,478 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:11:37,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 03:11:37,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 03:11:37,691 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:11:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:11:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2022-07-21 03:11:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:11:37,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882474872] [2022-07-21 03:11:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:11:37,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:11:37,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273004543] [2022-07-21 03:11:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:37,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:11:37,703 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:11:37,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 03:11:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:11:37,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-21 03:11:37,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:11:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:11:38,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:11:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-07-21 03:11:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:11:38,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882474872] [2022-07-21 03:11:38,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:11:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273004543] [2022-07-21 03:11:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273004543] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:11:38,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:11:38,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-07-21 03:11:38,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595845798] [2022-07-21 03:11:38,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:11:38,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-21 03:11:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:11:38,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-21 03:11:38,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-07-21 03:11:38,877 INFO L87 Difference]: Start difference. First operand 440 states and 483 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-07-21 03:11:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:11:40,033 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2022-07-21 03:11:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-07-21 03:11:40,033 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 229 [2022-07-21 03:11:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:11:40,037 INFO L225 Difference]: With dead ends: 929 [2022-07-21 03:11:40,037 INFO L226 Difference]: Without dead ends: 923 [2022-07-21 03:11:40,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-07-21 03:11:40,040 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 970 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 03:11:40,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 467 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 03:11:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-07-21 03:11:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2022-07-21 03:11:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 736 states have (on average 1.125) internal successors, (828), 736 states have internal predecessors, (828), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-07-21 03:11:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2022-07-21 03:11:40,102 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2022-07-21 03:11:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:11:40,103 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2022-07-21 03:11:40,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 50 states have internal predecessors, (301), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-07-21 03:11:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2022-07-21 03:11:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-07-21 03:11:40,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:11:40,108 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:11:40,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-21 03:11:40,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 03:11:40,323 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:11:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:11:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2022-07-21 03:11:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:11:40,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606663627] [2022-07-21 03:11:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:11:40,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:11:40,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315913969] [2022-07-21 03:11:40,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 03:11:40,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:40,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:11:40,347 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:11:40,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 03:11:40,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 03:11:40,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 03:11:40,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-21 03:11:40,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:11:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:11:41,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:11:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-07-21 03:11:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:11:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606663627] [2022-07-21 03:11:42,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 03:11:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315913969] [2022-07-21 03:11:42,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315913969] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:11:42,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:11:42,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-07-21 03:11:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667227132] [2022-07-21 03:11:42,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:11:42,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-21 03:11:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:11:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-21 03:11:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-07-21 03:11:42,108 INFO L87 Difference]: Start difference. First operand 920 states and 1011 transitions. Second operand has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-07-21 03:11:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:11:43,373 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2022-07-21 03:11:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-21 03:11:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 469 [2022-07-21 03:11:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:11:43,377 INFO L225 Difference]: With dead ends: 1009 [2022-07-21 03:11:43,377 INFO L226 Difference]: Without dead ends: 1003 [2022-07-21 03:11:43,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 883 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-07-21 03:11:43,380 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 376 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 03:11:43,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 503 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 03:11:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-07-21 03:11:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2022-07-21 03:11:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 800 states have (on average 1.125) internal successors, (900), 800 states have internal predecessors, (900), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-07-21 03:11:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2022-07-21 03:11:43,443 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2022-07-21 03:11:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:11:43,444 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2022-07-21 03:11:43,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.388888888888889) internal successors, (399), 54 states have internal predecessors, (399), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2022-07-21 03:11:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2022-07-21 03:11:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-07-21 03:11:43,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:11:43,451 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:11:43,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 03:11:43,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 03:11:43,668 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:11:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:11:43,669 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2022-07-21 03:11:43,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:11:43,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446571436] [2022-07-21 03:11:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:11:43,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:11:43,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 03:11:43,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1219690406] [2022-07-21 03:11:43,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 03:11:43,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:43,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:11:43,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 03:11:43,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 03:11:44,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2022-07-21 03:11:44,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-21 03:11:44,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 03:11:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 03:11:44,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 03:11:44,457 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 03:11:44,458 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 03:11:44,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 03:11:44,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 03:11:44,671 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 3, 1, 1, 1, 1, 1] [2022-07-21 03:11:44,673 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 03:11:44,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 03:11:44 BoogieIcfgContainer [2022-07-21 03:11:44,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 03:11:44,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 03:11:44,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 03:11:44,817 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 03:11:44,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:07:13" (3/4) ... [2022-07-21 03:11:44,819 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 03:11:44,915 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 03:11:44,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 03:11:44,915 INFO L158 Benchmark]: Toolchain (without parser) took 271524.31ms. Allocated memory was 62.9MB in the beginning and 121.6MB in the end (delta: 58.7MB). Free memory was 43.4MB in the beginning and 53.3MB in the end (delta: -9.9MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2022-07-21 03:11:44,916 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 44.6MB in the beginning and 44.6MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:11:44,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.56ms. Allocated memory is still 62.9MB. Free memory was 43.2MB in the beginning and 45.8MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 03:11:44,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.78ms. Allocated memory is still 62.9MB. Free memory was 45.8MB in the beginning and 44.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:11:44,917 INFO L158 Benchmark]: Boogie Preprocessor took 27.38ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 43.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:11:44,918 INFO L158 Benchmark]: RCFGBuilder took 230.04ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 33.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 03:11:44,918 INFO L158 Benchmark]: TraceAbstraction took 270906.56ms. Allocated memory was 62.9MB in the beginning and 121.6MB in the end (delta: 58.7MB). Free memory was 33.1MB in the beginning and 74.4MB in the end (delta: -41.3MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2022-07-21 03:11:44,918 INFO L158 Benchmark]: Witness Printer took 97.76ms. Allocated memory is still 121.6MB. Free memory was 74.4MB in the beginning and 53.3MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-21 03:11:44,923 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.16ms. Allocated memory is still 62.9MB. Free memory was 44.6MB in the beginning and 44.6MB in the end (delta: 33.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.56ms. Allocated memory is still 62.9MB. Free memory was 43.2MB in the beginning and 45.8MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.78ms. Allocated memory is still 62.9MB. Free memory was 45.8MB in the beginning and 44.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.38ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 43.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 230.04ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 33.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 270906.56ms. Allocated memory was 62.9MB in the beginning and 121.6MB in the end (delta: 58.7MB). Free memory was 33.1MB in the beginning and 74.4MB in the end (delta: -41.3MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * Witness Printer took 97.76ms. Allocated memory is still 121.6MB. Free memory was 74.4MB in the beginning and 53.3MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. 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=-193, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=1, counter++=0, v=-193, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=1, v=-193, x=0, X=197, 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=-193, x=0, x=0, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-193, x=0, X=197, x=0, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=1, v=-189, x=0, x=0, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=1, v=-189, x=0, x=0, X=197, x=1, y=0, Y=2] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-189, x=0, x=0, X=197, x=1, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=2, v=-189, x=0, X=197, x=2, x=1, y=0, Y=2] [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=-189, X=197, x=1, x=2, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-189, x=2, x=1, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-185, X=197, x=2, x=0, x=1, Y=2, y=0] [L45] x++ VAL [counter=2, v=-185, x=0, x=2, X=197, x=2, Y=2, y=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-185, x=2, X=197, x=2, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=3, v=-185, x=2, x=0, X=197, x=4, 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=-185, x=4, X=197, x=0, x=2, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-185, X=197, x=0, x=4, x=2, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-181, x=2, x=4, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=3, v=-181, x=0, X=197, x=4, x=3, Y=2, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-181, x=4, x=3, x=0, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=4, v=-181, x=0, x=3, x=6, X=197, 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=-181, x=0, x=3, X=197, x=6, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-181, x=0, x=3, x=6, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-177, X=197, x=3, x=0, x=6, Y=2, y=0] [L45] x++ VAL [counter=4, v=-177, x=4, x=6, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-177, X=197, x=4, x=0, x=6, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-177, x=4, X=197, x=8, 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=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=-177, x=8, x=0, x=4, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-177, x=8, x=0, x=4, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-173, x=4, X=197, x=0, x=8, Y=2, y=0] [L45] x++ VAL [counter=5, v=-173, X=197, x=5, x=8, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-173, x=5, X=197, x=0, x=8, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=6, v=-173, X=197, x=0, x=10, x=5, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=6, v=-173, X=197, x=5, x=10, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-173, X=197, x=5, x=0, x=10, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-169, x=0, X=197, x=10, x=5, Y=2, y=0] [L45] x++ VAL [counter=6, v=-169, x=0, X=197, x=10, x=6, y=0, Y=2] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-169, x=0, X=197, x=10, x=6, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=7, v=-169, x=0, x=6, X=197, x=12, Y=2, y=0] [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=-169, x=12, x=6, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-169, x=12, X=197, x=6, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-165, x=12, X=197, x=0, x=6, Y=2, y=0] [L45] x++ VAL [counter=7, v=-165, x=0, x=12, X=197, x=7, Y=2, y=0] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-165, x=7, X=197, x=0, x=12, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=8, v=-165, x=14, x=7, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=8, v=-165, x=7, x=14, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=8, v=-165, x=7, x=0, X=197, x=14, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-161, x=0, x=7, x=14, X=197, y=0, Y=2] [L45] x++ VAL [counter=8, v=-161, X=197, x=0, x=8, x=14, Y=2, y=0] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-161, x=8, x=0, X=197, x=14, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=9, v=-161, x=0, x=8, X=197, x=16, y=0, Y=2] [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=-161, x=8, x=16, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-161, X=197, x=0, x=16, x=8, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-157, x=0, x=16, X=197, x=8, Y=2, y=0] [L45] x++ VAL [counter=9, v=-157, x=9, x=16, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-157, X=197, x=0, x=9, x=16, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=10, v=-157, x=9, x=0, X=197, x=18, 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=-157, x=18, x=9, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-157, x=18, x=9, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-153, x=18, X=197, x=0, x=9, Y=2, y=0] [L45] x++ VAL [counter=10, v=-153, X=197, x=18, x=0, x=10, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-153, X=197, x=10, x=18, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-153, x=0, X=197, x=10, x=20, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=11, v=-153, x=20, X=197, x=0, x=10, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-153, x=0, x=10, X=197, x=20, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-149, x=0, x=20, x=10, X=197, y=0, Y=2] [L45] x++ VAL [counter=11, v=-149, x=20, x=0, X=197, x=11, Y=2, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-149, X=197, x=11, x=20, x=0, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-149, x=11, x=0, X=197, x=22, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=12, v=-149, X=197, x=22, x=0, x=11, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-149, x=11, X=197, x=22, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-145, x=0, X=197, x=11, x=22, Y=2, y=0] [L45] x++ VAL [counter=12, v=-145, x=12, x=22, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-145, X=197, x=0, x=12, x=22, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=13, v=-145, x=0, x=12, X=197, x=24, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=13, v=-145, x=0, X=197, x=12, x=24, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-145, X=197, x=0, x=12, x=24, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-141, x=12, x=0, X=197, x=24, Y=2, y=0] [L45] x++ VAL [counter=13, v=-141, x=13, X=197, x=24, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-141, x=13, X=197, x=0, x=24, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=14, v=-141, x=13, X=197, x=26, 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=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=14, v=-141, x=26, x=13, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-141, x=26, x=13, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-137, x=0, X=197, x=26, x=13, Y=2, y=0] [L45] x++ VAL [counter=14, v=-137, x=0, x=14, X=197, x=26, y=0, Y=2] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-137, X=197, x=0, x=14, x=26, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=15, v=-137, x=28, x=14, x=0, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=15, v=-137, X=197, x=14, x=28, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-137, x=28, x=14, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-133, x=0, X=197, x=14, x=28, Y=2, y=0] [L45] x++ VAL [counter=15, v=-133, x=15, x=0, x=28, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-133, x=0, x=28, x=15, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-133, X=197, x=0, x=30, x=15, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=16, v=-133, x=30, X=197, x=0, x=15, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-133, X=197, x=30, x=0, x=15, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-129, X=197, x=15, x=0, x=30, Y=2, y=0] [L45] x++ VAL [counter=16, v=-129, x=0, X=197, x=30, x=16, Y=2, y=0] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-129, x=0, X=197, x=30, x=16, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=17, v=-129, x=32, x=0, x=16, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=17, v=-129, x=0, X=197, x=32, x=16, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-129, x=16, x=0, x=32, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-125, x=0, X=197, x=32, x=16, Y=2, y=0] [L45] x++ VAL [counter=17, v=-125, x=0, x=32, X=197, x=17, Y=2, y=0] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-125, x=0, X=197, x=17, x=32, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=18, v=-125, x=17, x=0, x=34, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=18, v=-125, x=17, x=34, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-125, x=0, x=34, X=197, x=17, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-121, x=0, x=17, X=197, x=34, Y=2, y=0] [L45] x++ VAL [counter=18, v=-121, x=34, x=18, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-121, x=0, X=197, x=18, x=34, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=19, v=-121, x=36, X=197, x=0, x=18, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=19, v=-121, X=197, x=36, x=0, x=18, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-121, x=0, x=18, x=36, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-117, x=0, X=197, x=36, x=18, Y=2, y=0] [L45] x++ VAL [counter=19, v=-117, x=0, x=36, X=197, x=19, Y=2, y=0] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-117, x=36, x=19, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-117, X=197, x=0, x=19, x=38, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=20, v=-117, x=38, x=19, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-117, X=197, x=0, x=38, x=19, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-113, X=197, x=38, x=19, x=0, y=0, Y=2] [L45] x++ VAL [counter=20, v=-113, x=38, x=20, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-113, x=0, x=38, x=20, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=21, v=-113, X=197, x=20, x=40, 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=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=21, v=-113, x=40, X=197, x=0, x=20, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-113, X=197, x=40, x=20, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-109, x=40, x=0, X=197, x=20, y=0, Y=2] [L45] x++ VAL [counter=21, v=-109, X=197, x=40, x=0, x=21, y=0, Y=2] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-109, X=197, x=0, x=21, x=40, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=22, v=-109, x=21, x=0, x=42, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=22, v=-109, x=21, X=197, x=42, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-109, X=197, x=0, x=42, x=21, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-105, x=21, x=0, x=42, X=197, Y=2, y=0] [L45] x++ VAL [counter=22, v=-105, X=197, x=0, x=42, x=22, y=0, Y=2] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-105, X=197, x=42, x=0, x=22, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=23, v=-105, x=44, X=197, x=22, 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=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=23, v=-105, x=0, x=22, X=197, x=44, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-105, x=0, x=22, X=197, x=44, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-101, x=44, X=197, x=0, x=22, y=0, Y=2] [L45] x++ VAL [counter=23, v=-101, x=44, x=0, X=197, x=23, y=0, Y=2] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-101, x=0, X=197, x=23, x=44, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=24, v=-101, X=197, x=0, x=23, x=46, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=24, v=-101, x=23, x=0, X=197, x=46, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-101, x=46, x=0, X=197, x=23, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=24, v=-97, x=46, x=23, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=24, v=-97, x=24, X=197, x=0, x=46, y=0, Y=2] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-97, X=197, x=46, x=0, x=24, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=25, v=-97, x=24, x=0, X=197, x=48, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=25, v=-97, x=24, x=0, x=48, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-97, x=0, x=24, x=48, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=25, v=-93, x=24, x=48, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=25, v=-93, x=25, X=197, x=0, x=48, y=0, Y=2] [L31] EXPR counter++ VAL [counter=26, counter++=25, v=-93, X=197, x=48, x=0, x=25, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=26, v=-93, x=50, x=0, X=197, x=25, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=26, v=-93, x=50, x=0, X=197, x=25, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-93, x=50, x=0, X=197, x=25, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-89, x=25, X=197, x=50, x=0, Y=2, y=0] [L45] x++ VAL [counter=26, v=-89, x=50, x=0, x=26, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-89, x=50, x=0, x=26, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=27, v=-89, x=26, x=52, X=197, 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=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=27, v=-89, x=26, x=0, X=197, x=52, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-89, x=26, x=52, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-85, x=52, x=0, x=26, X=197, y=0, Y=2] [L45] x++ VAL [counter=27, v=-85, x=0, x=27, x=52, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-85, x=0, x=52, X=197, x=27, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=28, v=-85, x=54, x=0, x=27, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=28, v=-85, x=54, x=27, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-85, x=54, x=0, X=197, x=27, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-81, X=197, x=0, x=27, x=54, Y=2, y=0] [L45] x++ VAL [counter=28, v=-81, x=28, x=54, x=0, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-81, x=54, x=28, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=29, v=-81, x=56, x=28, x=0, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=29, v=-81, X=197, x=0, x=56, x=28, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-81, x=28, x=56, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-77, x=28, x=0, X=197, x=56, Y=2, y=0] [L45] x++ VAL [counter=29, v=-77, x=0, X=197, x=29, x=56, Y=2, y=0] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-77, x=29, x=0, X=197, x=56, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=30, v=-77, x=58, x=0, x=29, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=30, v=-77, X=197, x=0, x=29, x=58, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-77, x=58, x=0, X=197, x=29, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-73, x=58, X=197, x=29, x=0, Y=2, y=0] [L45] x++ VAL [counter=30, v=-73, x=0, x=58, X=197, x=30, Y=2, y=0] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-73, x=0, X=197, x=30, x=58, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=31, v=-73, x=0, X=197, x=30, x=60, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=31, v=-73, X=197, x=60, x=30, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-73, X=197, x=60, x=0, x=30, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-69, x=60, x=0, X=197, x=30, Y=2, y=0] [L45] x++ VAL [counter=31, v=-69, x=60, X=197, x=0, x=31, Y=2, y=0] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-69, x=0, x=31, x=60, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-69, x=62, X=197, x=0, x=31, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=32, v=-69, x=62, X=197, x=0, x=31, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-69, X=197, x=31, x=62, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-65, x=31, X=197, x=0, x=62, Y=2, y=0] [L45] x++ VAL [counter=32, v=-65, x=32, X=197, x=0, x=62, y=0, Y=2] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-65, x=62, x=32, x=0, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=33, v=-65, X=197, x=64, x=0, x=32, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=33, v=-65, x=0, x=64, X=197, x=32, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-65, x=64, x=32, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-61, x=32, x=64, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=33, v=-61, x=64, x=0, x=33, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-61, x=0, X=197, x=33, x=64, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-61, x=33, x=0, x=66, X=197, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=34, v=-61, x=66, X=197, x=33, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-61, x=33, x=66, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-57, x=0, x=33, X=197, x=66, y=0, Y=2] [L45] x++ VAL [counter=34, v=-57, X=197, x=0, x=66, x=34, Y=2, y=0] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-57, X=197, x=0, x=66, x=34, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=35, v=-57, X=197, x=0, x=34, x=68, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=35, v=-57, X=197, x=0, x=68, x=34, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-57, x=34, X=197, x=0, x=68, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-53, x=68, X=197, x=0, x=34, y=0, Y=2] [L45] x++ VAL [counter=35, v=-53, x=0, x=35, x=68, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-53, x=68, x=35, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=36, v=-53, x=0, x=35, X=197, x=70, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=36, v=-53, x=35, X=197, x=0, x=70, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-53, X=197, x=70, x=0, x=35, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-49, x=0, x=35, x=70, X=197, y=0, Y=2] [L45] x++ VAL [counter=36, v=-49, X=197, x=0, x=70, x=36, y=0, Y=2] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-49, x=0, x=36, x=70, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=37, v=-49, x=0, X=197, x=72, x=36, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=37, v=-49, x=0, x=36, X=197, x=72, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-49, x=72, x=36, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-45, x=72, X=197, x=0, x=36, y=0, Y=2] [L45] x++ VAL [counter=37, v=-45, x=0, x=37, x=72, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-45, x=37, x=0, X=197, x=72, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=38, v=-45, x=0, x=37, X=197, x=74, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=38, v=-45, X=197, x=0, x=74, x=37, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-45, x=0, x=74, X=197, x=37, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-41, X=197, x=74, x=0, x=37, y=0, Y=2] [L45] x++ VAL [counter=38, v=-41, x=38, X=197, x=0, x=74, y=0, Y=2] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-41, X=197, x=38, x=0, x=74, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=39, v=-41, x=76, x=0, x=38, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=39, v=-41, X=197, x=38, x=76, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-41, x=0, x=76, X=197, x=38, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-37, x=38, x=76, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=39, v=-37, x=0, x=39, X=197, x=76, Y=2, y=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-37, x=76, x=39, X=197, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=40, v=-37, x=39, x=78, X=197, 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=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=40, v=-37, x=39, x=78, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-37, X=197, x=0, x=39, x=78, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-33, x=39, x=0, x=78, X=197, Y=2, y=0] [L45] x++ VAL [counter=40, v=-33, x=40, x=0, x=78, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-33, X=197, x=0, x=40, x=78, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=41, v=-33, x=80, x=40, x=0, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=41, v=-33, x=80, x=0, x=40, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-33, X=197, x=40, x=0, x=80, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-29, x=80, X=197, x=0, x=40, Y=2, y=0] [L45] x++ VAL [counter=41, v=-29, x=0, x=41, X=197, x=80, y=0, Y=2] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-29, x=80, X=197, x=0, x=41, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=42, v=-29, x=41, x=82, x=0, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=42, v=-29, x=82, x=0, x=41, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-29, x=41, x=0, X=197, x=82, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=42, v=-25, x=82, x=41, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=42, v=-25, X=197, x=82, x=0, x=42, Y=2, y=0] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-25, x=42, x=0, x=82, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=43, v=-25, x=84, x=42, X=197, 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=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=43, v=-25, X=197, x=0, x=42, x=84, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-25, x=84, x=0, x=42, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-21, x=42, X=197, x=84, x=0, y=0, Y=2] [L45] x++ VAL [counter=43, v=-21, x=0, X=197, x=84, x=43, Y=2, y=0] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-21, x=43, x=0, X=197, x=84, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=44, v=-21, X=197, x=0, x=43, x=86, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=44, v=-21, x=86, X=197, x=0, x=43, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-21, x=0, x=43, X=197, x=86, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-17, x=0, x=43, x=86, X=197, Y=2, y=0] [L45] x++ VAL [counter=44, v=-17, X=197, x=86, x=44, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-17, x=44, x=0, x=86, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=45, v=-17, x=0, x=44, X=197, x=88, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=45, v=-17, x=0, x=88, X=197, x=44, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-17, x=0, X=197, x=88, x=44, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-13, X=197, x=44, x=0, x=88, y=0, Y=2] [L45] x++ VAL [counter=45, v=-13, x=0, X=197, x=88, x=45, y=0, Y=2] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-13, x=88, x=0, X=197, x=45, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=46, v=-13, X=197, x=45, x=90, 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=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=46, v=-13, x=0, X=197, x=45, x=90, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-13, x=0, X=197, x=45, x=90, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-9, X=197, x=90, x=0, x=45, y=0, Y=2] [L45] x++ VAL [counter=46, v=-9, x=0, x=46, X=197, x=90, Y=2, y=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-9, x=46, X=197, x=90, x=0, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=47, v=-9, x=0, x=92, X=197, x=46, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=47, v=-9, x=0, X=197, x=92, x=46, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-9, x=46, x=92, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-5, X=197, x=46, x=92, x=0, y=0, Y=2] [L45] x++ VAL [counter=47, v=-5, x=0, x=47, X=197, x=92, y=0, Y=2] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-5, x=92, X=197, x=0, x=47, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=48, v=-5, x=94, X=197, x=0, x=47, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=48, v=-5, x=47, x=94, X=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-5, X=197, x=0, x=94, x=47, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=48, v=-1, x=47, X=197, x=94, x=0, y=0, Y=2] [L45] x++ VAL [counter=48, v=-1, x=48, X=197, x=0, x=94, y=0, Y=2] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, x=48, x=0, x=94, X=197, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, X=197, x=96, x=0, x=48, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=49, v=-1, x=48, x=96, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, x=96, x=0, X=197, x=48, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=3, x=0, X=197, x=48, x=96, Y=2, y=0] [L45] x++ VAL [counter=49, v=3, x=0, x=96, X=197, x=49, Y=2, y=0] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=3, x=0, x=49, x=96, X=197, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=50, v=3, x=49, x=0, x=98, X=197, y=0, Y=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=50, v=3, x=49, X=197, x=0, x=98, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=3, X=197, x=98, x=49, x=0, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50, v=-387, x=49, x=0, x=98, X=197, y=1, Y=2] [L45] x++ VAL [counter=50, v=-387, X=197, x=98, x=0, x=50, y=1, Y=2] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-387, x=98, X=197, x=0, x=50, Y=2, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [counter=51, v=-387, x=50, x=100, x=50, X=197, Y=2, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 270.7s, OverallIterations: 14, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 1855 SdHoareTripleChecker+Valid, 17.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1850 mSDsluCounter, 2062 SdHoareTripleChecker+Invalid, 17.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 193 IncrementalHoareTripleChecker+Unchecked, 1744 mSDsCounter, 505 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1983 IncrementalHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 505 mSolverCounterUnsat, 318 mSDtfsCounter, 1983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2566 GetRequests, 2140 SyntacticMatches, 10 SemanticMatches, 416 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3494 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=13, InterpolantAutomatonStates: 378, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 94 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 231.3s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2369 ConstructedInterpolants, 7 QuantifiedInterpolants, 8752 SizeOfPredicates, 127 NumberOfNonLiveVariables, 3053 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 24 InterpolantComputations, 1 PerfectInterpolantSequences, 8301/29812 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! [2022-07-21 03:11:44,977 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