./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8 --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 19:13:35,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:13:35,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:13:35,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:13:35,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:13:35,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:13:35,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:13:35,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:13:35,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:13:35,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:13:35,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:13:35,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:13:35,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:13:35,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:13:35,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:13:35,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:13:35,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:13:35,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:13:35,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:13:35,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:13:35,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:13:35,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:13:35,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:13:35,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:13:35,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:13:35,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:13:35,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:13:35,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:13:35,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:13:35,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:13:35,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:13:35,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:13:35,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:13:35,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:13:35,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:13:35,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:13:35,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:13:35,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:13:35,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:13:35,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:13:35,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:13:35,552 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:13:35,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:13:35,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:13:35,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:13:35,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:13:35,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:13:35,575 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:13:35,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:13:35,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:13:35,576 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:13:35,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:13:35,576 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:13:35,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:13:35,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:13:35,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:13:35,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:13:35,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:13:35,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:13:35,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:13:35,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:13:35,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:13:35,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:13:35,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:13:35,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:13:35,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:13:35,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:13:35,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:13:35,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:13:35,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:13:35,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:13:35,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:13:35,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:13:35,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:13:35,580 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:13:35,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:13:35,581 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:13:35,581 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8 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-12-13 19:13:35,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:13:35,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:13:35,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:13:35,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:13:35,805 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:13:35,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-12-13 19:13:38,355 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:13:38,515 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:13:38,516 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2022-12-13 19:13:38,522 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/data/8cf6bbba7/059b23ac52a94dcb95b476481d1bb053/FLAG17b5d0298 [2022-12-13 19:13:38,918 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/data/8cf6bbba7/059b23ac52a94dcb95b476481d1bb053 [2022-12-13 19:13:38,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:13:38,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:13:38,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:13:38,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:13:38,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:13:38,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:13:38" (1/1) ... [2022-12-13 19:13:38,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41edaaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:38, skipping insertion in model container [2022-12-13 19:13:38,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:13:38" (1/1) ... [2022-12-13 19:13:38,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:13:38,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:13:39,056 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-12-13 19:13:39,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:13:39,079 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:13:39,088 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2022-12-13 19:13:39,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:13:39,105 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:13:39,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39 WrapperNode [2022-12-13 19:13:39,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:13:39,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:13:39,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:13:39,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:13:39,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,129 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2022-12-13 19:13:39,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:13:39,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:13:39,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:13:39,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:13:39,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,145 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:13:39,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:13:39,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:13:39,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:13:39,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (1/1) ... [2022-12-13 19:13:39,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:13:39,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:39,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:13:39,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:13:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:13:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:13:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:13:39,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:13:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-12-13 19:13:39,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-12-13 19:13:39,265 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:13:39,266 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:13:39,357 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:13:39,362 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:13:39,362 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 19:13:39,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:13:39 BoogieIcfgContainer [2022-12-13 19:13:39,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:13:39,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:13:39,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:13:39,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:13:39,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:13:38" (1/3) ... [2022-12-13 19:13:39,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec36a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:13:39, skipping insertion in model container [2022-12-13 19:13:39,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:13:39" (2/3) ... [2022-12-13 19:13:39,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec36a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:13:39, skipping insertion in model container [2022-12-13 19:13:39,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:13:39" (3/3) ... [2022-12-13 19:13:39,371 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2022-12-13 19:13:39,389 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:13:39,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 19:13:39,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:13:39,436 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@135eacf1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:13:39,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 19:13:39,439 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-12-13 19:13:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 19:13:39,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:39,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:39,444 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:39,448 INFO L85 PathProgramCache]: Analyzing trace with hash 180444447, now seen corresponding path program 1 times [2022-12-13 19:13:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:39,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106485954] [2022-12-13 19:13:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:39,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:39,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99611415] [2022-12-13 19:13:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:39,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:39,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:39,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:39,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:13:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:13:39,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 19:13:39,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:39,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:13:39,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:39,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106485954] [2022-12-13 19:13:39,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:39,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99611415] [2022-12-13 19:13:39,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99611415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:13:39,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:13:39,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:13:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122671572] [2022-12-13 19:13:39,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:13:39,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:13:39,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:39,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:13:39,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:13:39,760 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-12-13 19:13:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:39,872 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-12-13 19:13:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:13:39,874 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-12-13 19:13:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:39,880 INFO L225 Difference]: With dead ends: 54 [2022-12-13 19:13:39,880 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 19:13:39,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:13:39,884 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:39,885 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.1s Time] [2022-12-13 19:13:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 19:13:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-12-13 19:13:39,912 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-12-13 19:13:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-12-13 19:13:39,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 8 [2022-12-13 19:13:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:39,915 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-12-13 19:13:39,915 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-12-13 19:13:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-12-13 19:13:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 19:13:39,916 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:39,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:39,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:13:40,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-12-13 19:13:40,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2080570626, now seen corresponding path program 1 times [2022-12-13 19:13:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110788409] [2022-12-13 19:13:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:40,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:40,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888166183] [2022-12-13 19:13:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:40,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:40,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:40,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:40,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:13:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:13:40,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 19:13:40,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:40,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:13:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:40,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110788409] [2022-12-13 19:13:40,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:40,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888166183] [2022-12-13 19:13:40,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888166183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:13:40,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:13:40,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-12-13 19:13:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930377339] [2022-12-13 19:13:40,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:13:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 19:13:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 19:13:40,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-13 19:13:40,833 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:13:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:41,153 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-12-13 19:13:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 19:13:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 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-12-13 19:13:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:41,154 INFO L225 Difference]: With dead ends: 41 [2022-12-13 19:13:41,154 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 19:13:41,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-12-13 19:13:41,157 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:41,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:13:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 19:13:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-12-13 19:13:41,166 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-12-13 19:13:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-12-13 19:13:41,167 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2022-12-13 19:13:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:41,167 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-12-13 19:13:41,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:13:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-12-13 19:13:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 19:13:41,169 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:41,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:41,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:13:41,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-13 19:13:41,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash 680664555, now seen corresponding path program 1 times [2022-12-13 19:13:41,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:41,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154660336] [2022-12-13 19:13:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:41,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29391877] [2022-12-13 19:13:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:41,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:41,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:41,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:41,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:13:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:13:41,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 19:13:41,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:41,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:13:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:41,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:41,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154660336] [2022-12-13 19:13:41,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:41,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29391877] [2022-12-13 19:13:41,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29391877] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:13:41,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:13:41,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-12-13 19:13:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526261941] [2022-12-13 19:13:41,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:13:41,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 19:13:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 19:13:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:13:41,541 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-12-13 19:13:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:41,597 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-12-13 19:13:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 19:13:41,597 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-12-13 19:13:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:41,599 INFO L225 Difference]: With dead ends: 73 [2022-12-13 19:13:41,599 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 19:13:41,599 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-12-13 19:13:41,601 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:41,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 19:13:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 19:13:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-12-13 19:13:41,614 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-12-13 19:13:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-12-13 19:13:41,615 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 19 [2022-12-13 19:13:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:41,616 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-12-13 19:13:41,616 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-12-13 19:13:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-12-13 19:13:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 19:13:41,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:41,617 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:41,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:13:41,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:41,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash 713886481, now seen corresponding path program 1 times [2022-12-13 19:13:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:41,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959977781] [2022-12-13 19:13:41,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:41,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:41,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765606679] [2022-12-13 19:13:41,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:41,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:41,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:41,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:13:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:13:41,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 19:13:41,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:13:42,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:13:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:13:42,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:42,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959977781] [2022-12-13 19:13:42,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765606679] [2022-12-13 19:13:42,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765606679] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:13:42,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:13:42,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2022-12-13 19:13:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012002028] [2022-12-13 19:13:42,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:13:42,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 19:13:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:42,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 19:13:42,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-12-13 19:13:42,485 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 19:13:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:43,205 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-12-13 19:13:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 19:13:43,205 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 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-12-13 19:13:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:43,206 INFO L225 Difference]: With dead ends: 65 [2022-12-13 19:13:43,206 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 19:13:43,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 19:13:43,209 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:43,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 78 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:13:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 19:13:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-12-13 19:13:43,218 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-12-13 19:13:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-12-13 19:13:43,219 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 25 [2022-12-13 19:13:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:43,219 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-12-13 19:13:43,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 19:13:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-12-13 19:13:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 19:13:43,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:43,220 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:43,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 19:13:43,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:43,420 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:43,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1582515168, now seen corresponding path program 1 times [2022-12-13 19:13:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:43,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901937600] [2022-12-13 19:13:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:43,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:43,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135504989] [2022-12-13 19:13:43,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:43,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:43,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:43,440 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:43,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:13:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:13:43,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 19:13:43,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:43,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:13:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 19:13:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:43,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901937600] [2022-12-13 19:13:43,638 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:43,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135504989] [2022-12-13 19:13:43,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135504989] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:13:43,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:13:43,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-12-13 19:13:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477463824] [2022-12-13 19:13:43,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:13:43,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:13:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:43,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:13:43,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-12-13 19:13:43,641 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-12-13 19:13:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:43,777 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-12-13 19:13:43,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 19:13:43,778 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-12-13 19:13:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:43,780 INFO L225 Difference]: With dead ends: 116 [2022-12-13 19:13:43,780 INFO L226 Difference]: Without dead ends: 110 [2022-12-13 19:13:43,781 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-12-13 19:13:43,781 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:43,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 166 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:13:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-13 19:13:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-12-13 19:13:43,799 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-12-13 19:13:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-12-13 19:13:43,800 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 49 [2022-12-13 19:13:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:43,800 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-12-13 19:13:43,801 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-12-13 19:13:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-12-13 19:13:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-13 19:13:43,802 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:43,802 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:43,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 19:13:44,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:44,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 297311502, now seen corresponding path program 2 times [2022-12-13 19:13:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:44,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596869677] [2022-12-13 19:13:44,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:44,014 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:44,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872423835] [2022-12-13 19:13:44,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:13:44,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:44,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:44,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:44,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 19:13:44,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:13:44,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:13:44,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 19:13:44,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:44,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:13:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-12-13 19:13:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:44,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596869677] [2022-12-13 19:13:44,442 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:44,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872423835] [2022-12-13 19:13:44,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872423835] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:13:44,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:13:44,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-12-13 19:13:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792569970] [2022-12-13 19:13:44,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:13:44,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 19:13:44,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:44,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 19:13:44,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-12-13 19:13:44,446 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-12-13 19:13:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:44,824 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-12-13 19:13:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 19:13:44,824 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-12-13 19:13:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:44,827 INFO L225 Difference]: With dead ends: 236 [2022-12-13 19:13:44,827 INFO L226 Difference]: Without dead ends: 230 [2022-12-13 19:13:44,829 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-12-13 19:13:44,830 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 127 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:44,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 286 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:13:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-12-13 19:13:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-12-13 19:13:44,856 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-12-13 19:13:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 252 transitions. [2022-12-13 19:13:44,857 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 252 transitions. Word has length 109 [2022-12-13 19:13:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:44,858 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 252 transitions. [2022-12-13 19:13:44,858 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-12-13 19:13:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 252 transitions. [2022-12-13 19:13:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-12-13 19:13:44,862 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:44,862 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:44,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 19:13:45,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 19:13:45,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:45,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1294150550, now seen corresponding path program 3 times [2022-12-13 19:13:45,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:45,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973018293] [2022-12-13 19:13:45,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:45,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:45,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220531770] [2022-12-13 19:13:45,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:13:45,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:45,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:45,098 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:45,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 19:13:45,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 19:13:45,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:13:45,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 19:13:45,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-12-13 19:13:45,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:13:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2022-12-13 19:13:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:45,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973018293] [2022-12-13 19:13:45,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:45,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220531770] [2022-12-13 19:13:45,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220531770] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:13:45,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:13:45,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-12-13 19:13:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527539737] [2022-12-13 19:13:45,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:13:45,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 19:13:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 19:13:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-12-13 19:13:45,707 INFO L87 Difference]: Start difference. First operand 230 states and 252 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 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-12-13 19:13:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:45,907 INFO L93 Difference]: Finished difference Result 449 states and 492 transitions. [2022-12-13 19:13:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 19:13:45,908 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 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 229 [2022-12-13 19:13:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:45,910 INFO L225 Difference]: With dead ends: 449 [2022-12-13 19:13:45,910 INFO L226 Difference]: Without dead ends: 443 [2022-12-13 19:13:45,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 439 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-12-13 19:13:45,910 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:45,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:13:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-12-13 19:13:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2022-12-13 19:13:45,952 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-12-13 19:13:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 483 transitions. [2022-12-13 19:13:45,953 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 483 transitions. Word has length 229 [2022-12-13 19:13:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:45,954 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 483 transitions. [2022-12-13 19:13:45,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 17 states have internal predecessors, (34), 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-12-13 19:13:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 483 transitions. [2022-12-13 19:13:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-12-13 19:13:45,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:45,957 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:45,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 19:13:46,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:46,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash -614092180, now seen corresponding path program 1 times [2022-12-13 19:13:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:46,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912340934] [2022-12-13 19:13:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:46,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:46,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:46,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123833669] [2022-12-13 19:13:46,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:46,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:46,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:46,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:46,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 19:13:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:13:46,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 19:13:46,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:46,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:13:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-12-13 19:13:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:47,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912340934] [2022-12-13 19:13:47,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:47,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123833669] [2022-12-13 19:13:47,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123833669] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:13:47,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:13:47,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-12-13 19:13:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936578257] [2022-12-13 19:13:47,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:13:47,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 19:13:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:47,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 19:13:47,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-12-13 19:13:47,357 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-12-13 19:13:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:48,455 INFO L93 Difference]: Finished difference Result 929 states and 1043 transitions. [2022-12-13 19:13:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-12-13 19:13:48,456 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-12-13 19:13:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:48,460 INFO L225 Difference]: With dead ends: 929 [2022-12-13 19:13:48,460 INFO L226 Difference]: Without dead ends: 923 [2022-12-13 19:13:48,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-12-13 19:13:48,464 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 354 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:48,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 544 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:13:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-12-13 19:13:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 920. [2022-12-13 19:13:48,545 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-12-13 19:13:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1011 transitions. [2022-12-13 19:13:48,549 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1011 transitions. Word has length 229 [2022-12-13 19:13:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:48,550 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1011 transitions. [2022-12-13 19:13:48,550 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-12-13 19:13:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1011 transitions. [2022-12-13 19:13:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-12-13 19:13:48,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:48,558 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:48,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 19:13:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:48,759 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1651100380, now seen corresponding path program 2 times [2022-12-13 19:13:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:48,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17823761] [2022-12-13 19:13:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:48,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:48,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689013565] [2022-12-13 19:13:48,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:13:48,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:48,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:48,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:48,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 19:13:49,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:13:49,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:13:49,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-13 19:13:49,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:13:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:13:50,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:13:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2022-12-13 19:13:51,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:13:51,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17823761] [2022-12-13 19:13:51,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 19:13:51,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689013565] [2022-12-13 19:13:51,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689013565] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:13:51,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:13:51,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-12-13 19:13:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843232523] [2022-12-13 19:13:51,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:13:51,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 19:13:51,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:13:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 19:13:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-12-13 19:13:51,071 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-12-13 19:13:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:13:52,125 INFO L93 Difference]: Finished difference Result 1009 states and 1111 transitions. [2022-12-13 19:13:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-13 19:13:52,125 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-12-13 19:13:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:13:52,128 INFO L225 Difference]: With dead ends: 1009 [2022-12-13 19:13:52,128 INFO L226 Difference]: Without dead ends: 1003 [2022-12-13 19:13:52,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 840 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-12-13 19:13:52,130 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 143 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:13:52,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 521 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:13:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-12-13 19:13:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1000. [2022-12-13 19:13:52,227 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-12-13 19:13:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1099 transitions. [2022-12-13 19:13:52,229 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1099 transitions. Word has length 469 [2022-12-13 19:13:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:13:52,230 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1099 transitions. [2022-12-13 19:13:52,231 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-12-13 19:13:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1099 transitions. [2022-12-13 19:13:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-12-13 19:13:52,236 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:13:52,236 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:13:52,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 19:13:52,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:52,437 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 19:13:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:13:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash -234739816, now seen corresponding path program 3 times [2022-12-13 19:13:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:13:52,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788554202] [2022-12-13 19:13:52,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:13:52,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:13:52,489 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 19:13:52,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967416044] [2022-12-13 19:13:52,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 19:13:52,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:13:52,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:13:52,490 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:13:52,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 19:13:52,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2022-12-13 19:13:52,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 19:13:52,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:13:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:13:53,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:13:53,204 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:13:53,205 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 19:13:53,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 19:13:53,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 19:13:53,418 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2022-12-13 19:13:53,434 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:13:53,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:13:53 BoogieIcfgContainer [2022-12-13 19:13:53,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:13:53,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:13:53,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:13:53,580 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:13:53,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:13:39" (3/4) ... [2022-12-13 19:13:53,581 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 19:13:53,666 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:13:53,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:13:53,667 INFO L158 Benchmark]: Toolchain (without parser) took 14745.62ms. Allocated memory was 123.7MB in the beginning and 182.5MB in the end (delta: 58.7MB). Free memory was 92.6MB in the beginning and 73.8MB in the end (delta: 18.8MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2022-12-13 19:13:53,667 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory was 90.2MB in the beginning and 90.2MB in the end (delta: 21.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:13:53,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.55ms. Allocated memory is still 123.7MB. Free memory was 92.6MB in the beginning and 81.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:13:53,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.70ms. Allocated memory is still 123.7MB. Free memory was 81.9MB in the beginning and 80.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:13:53,668 INFO L158 Benchmark]: Boogie Preprocessor took 16.60ms. Allocated memory is still 123.7MB. Free memory was 80.3MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:13:53,668 INFO L158 Benchmark]: RCFGBuilder took 215.94ms. Allocated memory is still 123.7MB. Free memory was 79.2MB in the beginning and 68.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:13:53,668 INFO L158 Benchmark]: TraceAbstraction took 14214.08ms. Allocated memory was 123.7MB in the beginning and 182.5MB in the end (delta: 58.7MB). Free memory was 68.2MB in the beginning and 93.7MB in the end (delta: -25.5MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2022-12-13 19:13:53,669 INFO L158 Benchmark]: Witness Printer took 86.94ms. Allocated memory is still 182.5MB. Free memory was 93.7MB in the beginning and 73.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 19:13:53,670 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.15ms. Allocated memory is still 123.7MB. Free memory was 90.2MB in the beginning and 90.2MB in the end (delta: 21.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.55ms. Allocated memory is still 123.7MB. Free memory was 92.6MB in the beginning and 81.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.70ms. Allocated memory is still 123.7MB. Free memory was 81.9MB in the beginning and 80.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.60ms. Allocated memory is still 123.7MB. Free memory was 80.3MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 215.94ms. Allocated memory is still 123.7MB. Free memory was 79.2MB in the beginning and 68.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14214.08ms. Allocated memory was 123.7MB in the beginning and 182.5MB in the end (delta: 58.7MB). Free memory was 68.2MB in the beginning and 93.7MB in the end (delta: -25.5MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Witness Printer took 86.94ms. Allocated memory is still 182.5MB. Free memory was 93.7MB in the beginning and 73.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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=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=1, v=-193, x=0, x=0, 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=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=197, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=1, v=-193, X=197, x=0, 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=197, x=0, x=0, x=0, y=0, Y=2] [L45] x++ VAL [counter=1, v=-189, x=1, x=0, X=197, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=2, counter++=1, v=-189, x=1, X=197, x=0, 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=2, v=-189, x=0, X=197, x=2, x=1, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=2, v=-189, x=2, x=1, x=0, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=2, v=-189, x=1, x=2, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=2, v=-185, x=0, x=2, X=197, x=1, y=0, Y=2] [L45] x++ VAL [counter=2, v=-185, x=2, x=0, X=197, x=2, Y=2, y=0] [L31] EXPR counter++ VAL [counter=3, counter++=2, v=-185, X=197, x=2, 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=197, x=0, x=4, x=2, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=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=2, x=0, x=4, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=3, v=-185, x=2, X=197, x=0, x=4, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=3, v=-181, x=4, x=2, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=3, v=-181, x=4, X=197, x=0, x=3, Y=2, y=0] [L31] EXPR counter++ VAL [counter=4, counter++=3, v=-181, x=4, x=0, X=197, x=3, Y=2, y=0] [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=197, x=6, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=4, v=-181, x=0, x=3, x=6, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=4, v=-181, x=6, x=3, x=0, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=4, v=-177, x=0, x=3, X=197, x=6, Y=2, y=0] [L45] x++ VAL [counter=4, v=-177, x=0, X=197, x=6, x=4, Y=2, y=0] [L31] EXPR counter++ VAL [counter=5, counter++=4, v=-177, X=197, x=0, x=6, x=4, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=5, v=-177, X=197, x=0, x=8, 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=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=0, X=197, x=4, x=8, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=5, v=-177, x=4, x=8, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=5, v=-173, x=0, X=197, x=4, x=8, y=0, Y=2] [L45] x++ VAL [counter=5, v=-173, x=5, x=8, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=6, counter++=5, v=-173, x=0, x=8, x=5, 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=6, v=-173, x=10, X=197, x=5, 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=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=5, X=197, x=10, x=0, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=6, v=-173, x=5, X=197, x=10, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=6, v=-169, x=10, x=5, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=6, v=-169, x=0, x=10, x=6, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=7, counter++=6, v=-169, X=197, x=10, x=0, x=6, Y=2, y=0] [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=12, 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=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=6, X=197, x=0, x=12, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=7, v=-169, x=0, x=6, x=12, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=7, v=-165, x=0, x=12, X=197, x=6, y=0, Y=2] [L45] x++ VAL [counter=7, v=-165, x=12, x=7, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=8, counter++=7, v=-165, x=12, X=197, x=7, 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=8, v=-165, x=0, x=7, x=14, 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=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=14, X=197, x=0, x=7, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=8, v=-161, x=0, x=14, x=7, X=197, Y=2, y=0] [L45] x++ VAL [counter=8, v=-161, x=14, x=8, X=197, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=9, counter++=8, v=-161, x=14, x=0, X=197, 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=9, v=-161, x=8, X=197, x=16, x=0, Y=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [counter=9, v=-161, X=197, x=0, x=16, x=8, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=9, v=-161, x=8, X=197, x=16, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=9, v=-157, X=197, x=16, x=8, x=0, y=0, Y=2] [L45] x++ VAL [counter=9, v=-157, X=197, x=16, x=9, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=10, counter++=9, v=-157, x=9, x=0, x=16, 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=10, v=-157, x=0, x=9, x=18, 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=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=9, X=197, x=18, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=10, v=-157, X=197, x=18, x=0, x=9, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=10, v=-153, x=9, X=197, x=0, x=18, Y=2, y=0] [L45] x++ VAL [counter=10, v=-153, x=10, x=18, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=11, counter++=10, v=-153, x=0, x=10, X=197, x=18, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=11, v=-153, x=20, X=197, x=0, x=10, Y=2, y=0] [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=10, x=0, x=20, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=11, v=-153, x=10, X=197, x=0, x=20, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=11, v=-149, x=20, x=10, x=0, X=197, Y=2, y=0] [L45] x++ VAL [counter=11, v=-149, x=0, x=20, X=197, x=11, Y=2, y=0] [L31] EXPR counter++ VAL [counter=12, counter++=11, v=-149, x=0, x=20, X=197, x=11, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=12, v=-149, X=197, x=22, x=0, x=11, Y=2, y=0] [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=11, X=197, x=22, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=12, v=-149, X=197, x=11, x=0, x=22, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=12, v=-145, X=197, x=11, x=0, x=22, y=0, Y=2] [L45] x++ VAL [counter=12, v=-145, x=0, X=197, x=22, x=12, Y=2, y=0] [L31] EXPR counter++ VAL [counter=13, counter++=12, v=-145, x=22, X=197, x=12, 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=13, v=-145, X=197, x=12, x=0, x=24, Y=2, y=0] [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=24, x=0, X=197, x=12, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=13, v=-145, x=0, x=12, X=197, x=24, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=13, v=-141, X=197, x=24, x=12, x=0, y=0, Y=2] [L45] x++ VAL [counter=13, v=-141, x=0, x=24, X=197, x=13, y=0, Y=2] [L31] EXPR counter++ VAL [counter=14, counter++=13, v=-141, x=24, x=13, 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=14, v=-141, x=26, X=197, x=0, x=13, 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=13, x=0, x=26, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=14, v=-141, x=26, X=197, x=13, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=14, v=-137, x=26, x=13, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=14, v=-137, X=197, x=14, x=0, x=26, Y=2, y=0] [L31] EXPR counter++ VAL [counter=15, counter++=14, v=-137, X=197, x=26, x=14, 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=15, v=-137, x=14, x=0, x=28, 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=0, x=28, x=14, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=15, v=-137, x=28, X=197, x=14, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=15, v=-133, x=0, x=14, X=197, x=28, y=0, Y=2] [L45] x++ VAL [counter=15, v=-133, x=28, X=197, x=15, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=16, counter++=15, v=-133, X=197, x=0, x=28, x=15, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=16, v=-133, x=0, X=197, 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=0, x=15, X=197, x=30, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=16, v=-133, x=15, X=197, x=30, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=16, v=-129, X=197, x=0, x=30, x=15, y=0, Y=2] [L45] x++ VAL [counter=16, v=-129, x=16, X=197, x=30, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=17, counter++=16, v=-129, x=30, X=197, x=16, 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=17, v=-129, X=197, x=32, x=16, 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=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=197, x=0, x=32, x=16, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=17, v=-129, X=197, x=32, x=16, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=17, v=-125, x=32, x=16, x=0, X=197, y=0, Y=2] [L45] x++ VAL [counter=17, v=-125, x=0, x=17, x=32, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=18, counter++=17, v=-125, X=197, x=0, x=32, x=17, 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=197, x=0, x=34, 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=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=18, v=-125, x=17, X=197, x=0, x=34, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=18, v=-121, X=197, x=34, x=17, x=0, y=0, Y=2] [L45] x++ VAL [counter=18, v=-121, x=0, x=34, x=18, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=19, counter++=18, v=-121, x=34, x=0, X=197, x=18, 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=0, x=18, X=197, x=36, 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=0, x=36, X=197, x=18, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=19, v=-121, X=197, x=36, x=0, x=18, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=19, v=-117, x=36, x=0, x=18, X=197, Y=2, y=0] [L45] x++ VAL [counter=19, v=-117, x=0, x=36, x=19, X=197, Y=2, y=0] [L31] EXPR counter++ VAL [counter=20, counter++=19, v=-117, x=36, x=0, X=197, x=19, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=20, v=-117, x=38, x=0, x=19, 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=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=0, x=38, x=19, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=20, v=-117, x=38, x=19, x=0, X=197, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=20, v=-113, x=38, x=19, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=20, v=-113, x=0, x=20, X=197, x=38, y=0, Y=2] [L31] EXPR counter++ VAL [counter=21, counter++=20, v=-113, X=197, x=20, x=38, 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=21, v=-113, x=0, x=20, x=40, 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=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=197, x=0, x=20, x=40, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=21, v=-113, x=40, x=20, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=21, v=-109, X=197, x=40, x=20, x=0, y=0, Y=2] [L45] x++ VAL [counter=21, v=-109, X=197, x=21, x=0, x=40, y=0, Y=2] [L31] EXPR counter++ VAL [counter=22, counter++=21, v=-109, x=21, x=40, 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=22, v=-109, X=197, x=21, x=0, x=42, Y=2, y=0] [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=42, X=197, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=22, v=-109, X=197, x=42, x=0, x=21, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=22, v=-105, x=0, x=42, x=21, X=197, y=0, Y=2] [L45] x++ VAL [counter=22, v=-105, x=0, x=42, x=22, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=23, counter++=22, v=-105, x=22, x=42, 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=23, v=-105, x=22, x=0, x=44, 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=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=197, x=44, x=0, x=22, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=23, v=-105, x=22, X=197, x=44, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=23, v=-101, x=0, x=44, X=197, x=22, Y=2, y=0] [L45] x++ VAL [counter=23, v=-101, x=23, X=197, x=44, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=24, counter++=23, v=-101, x=23, X=197, x=44, 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=24, v=-101, x=23, x=46, 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=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=0, X=197, x=46, x=23, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=24, v=-101, x=0, x=46, 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=23, x=0, X=197, x=46, y=0, Y=2] [L45] x++ VAL [counter=24, v=-97, X=197, x=24, x=46, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=25, counter++=24, v=-97, X=197, x=46, x=0, x=24, y=0, Y=2] [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=197, x=24, x=0, x=48, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=25, v=-97, x=0, x=24, x=48, X=197, y=0, Y=2] [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=48, x=0, X=197, x=25, 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=0, x=25, x=50, 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=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=25, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=26, v=-93, x=50, x=25, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=26, v=-89, x=0, x=25, x=50, X=197, Y=2, y=0] [L45] x++ VAL [counter=26, v=-89, x=0, x=26, X=197, x=50, y=0, Y=2] [L31] EXPR counter++ VAL [counter=27, counter++=26, v=-89, x=26, x=0, x=50, 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=27, v=-89, x=26, x=52, 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=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=52, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=27, v=-89, x=26, X=197, x=52, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=27, v=-85, x=26, x=0, X=197, x=52, Y=2, y=0] [L45] x++ VAL [counter=27, v=-85, x=0, x=52, x=27, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=28, counter++=27, v=-85, x=27, x=52, 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=28, v=-85, x=0, x=27, x=54, 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=197, x=27, x=0, x=54, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=28, v=-85, x=27, X=197, x=0, x=54, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=28, v=-81, x=0, X=197, x=27, x=54, y=0, Y=2] [L45] x++ VAL [counter=28, v=-81, x=0, x=54, X=197, x=28, y=0, Y=2] [L31] EXPR counter++ VAL [counter=29, counter++=28, v=-81, x=0, x=28, X=197, x=54, 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=0, X=197, x=28, x=56, 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=56, x=0, X=197, x=28, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=29, v=-81, x=0, x=28, x=56, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=29, v=-77, x=0, x=28, X=197, x=56, y=0, Y=2] [L45] x++ VAL [counter=29, v=-77, X=197, x=56, x=0, x=29, y=0, Y=2] [L31] EXPR counter++ VAL [counter=30, counter++=29, v=-77, x=29, x=56, 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=30, v=-77, x=29, x=0, X=197, x=58, 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=0, x=58, x=29, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=30, v=-77, x=29, X=197, x=58, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=30, v=-73, x=29, X=197, x=58, x=0, y=0, Y=2] [L45] x++ VAL [counter=30, v=-73, x=0, x=30, X=197, x=58, y=0, Y=2] [L31] EXPR counter++ VAL [counter=31, counter++=30, v=-73, x=30, x=58, X=197, 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=31, v=-73, X=197, x=30, x=0, x=60, Y=2, y=0] [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=60, x=30, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=31, v=-73, x=0, x=30, X=197, x=60, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=31, v=-69, x=0, X=197, x=30, x=60, y=0, Y=2] [L45] x++ VAL [counter=31, v=-69, X=197, x=31, x=60, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=32, counter++=31, v=-69, x=0, x=31, X=197, x=60, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=32, v=-69, x=31, x=0, x=62, 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=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=197, x=0, x=31, x=62, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=32, v=-69, x=0, X=197, x=31, x=62, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=32, v=-65, X=197, x=31, x=0, x=62, y=0, Y=2] [L45] x++ VAL [counter=32, v=-65, x=32, x=0, X=197, x=62, y=0, Y=2] [L31] EXPR counter++ VAL [counter=33, counter++=32, v=-65, x=0, X=197, x=62, x=32, 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=64, x=0, X=197, 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=197, x=32, x=64, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=33, v=-65, x=64, X=197, x=0, x=32, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=33, v=-61, X=197, x=0, x=32, x=64, y=0, Y=2] [L45] x++ VAL [counter=33, v=-61, X=197, x=64, x=0, x=33, y=0, Y=2] [L31] EXPR counter++ VAL [counter=34, counter++=33, v=-61, X=197, x=0, x=33, x=64, y=0, Y=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=34, v=-61, x=66, x=33, X=197, 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=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=197, x=0, x=66, x=33, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=34, v=-61, x=0, X=197, x=66, x=33, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=34, v=-57, x=0, X=197, x=33, x=66, Y=2, y=0] [L45] x++ VAL [counter=34, v=-57, X=197, x=0, x=66, x=34, y=0, Y=2] [L31] EXPR counter++ VAL [counter=35, counter++=34, v=-57, x=0, x=34, X=197, x=66, 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=0, x=68, x=34, 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=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=34, x=0, x=68, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=35, v=-57, x=0, X=197, x=34, x=68, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=35, v=-53, x=0, X=197, x=34, x=68, y=0, Y=2] [L45] x++ VAL [counter=35, v=-53, x=68, X=197, x=35, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=36, counter++=35, v=-53, X=197, x=68, x=35, 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=70, X=197, x=35, 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=197, x=35, x=0, x=70, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=36, v=-53, x=0, X=197, x=35, x=70, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=36, v=-49, x=0, x=70, x=35, X=197, Y=2, y=0] [L45] x++ VAL [counter=36, v=-49, x=0, x=36, X=197, x=70, Y=2, y=0] [L31] EXPR counter++ VAL [counter=37, counter++=36, v=-49, X=197, x=70, x=36, 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=37, v=-49, X=197, x=72, x=0, 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=72, x=36, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=37, v=-49, x=36, x=72, X=197, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=37, v=-45, x=0, x=36, X=197, x=72, Y=2, y=0] [L45] x++ VAL [counter=37, v=-45, X=197, x=37, x=72, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=38, counter++=37, v=-45, X=197, x=0, x=37, 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=197, x=37, x=74, y=0, Y=2] [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=0, x=74, x=37, X=197, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=38, v=-45, x=37, x=74, X=197, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=38, v=-41, X=197, x=37, x=0, x=74, Y=2, y=0] [L45] x++ VAL [counter=38, v=-41, x=74, X=197, x=38, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=39, counter++=38, v=-41, X=197, x=74, x=38, 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=39, v=-41, X=197, x=38, x=0, x=76, Y=2, y=0] [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=0, x=38, x=76, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=39, v=-41, x=0, x=76, x=38, X=197, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=39, v=-37, X=197, x=0, x=38, x=76, y=0, Y=2] [L45] x++ VAL [counter=39, v=-37, x=39, x=0, X=197, x=76, Y=2, y=0] [L31] EXPR counter++ VAL [counter=40, counter++=39, v=-37, X=197, x=76, x=39, 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=40, v=-37, x=78, X=197, x=39, 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=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=78, x=39, x=0, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=40, v=-37, x=78, X=197, x=39, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=40, v=-33, x=39, X=197, x=78, x=0, y=0, Y=2] [L45] x++ VAL [counter=40, v=-33, x=40, X=197, x=78, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=41, counter++=40, v=-33, X=197, x=0, x=40, x=78, Y=2, y=0] [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=0, x=40, 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=197, x=0, x=40, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=41, v=-33, x=40, X=197, x=0, x=80, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=41, v=-29, X=197, x=0, x=40, x=80, y=0, Y=2] [L45] x++ VAL [counter=41, v=-29, x=80, X=197, x=0, x=41, y=0, Y=2] [L31] EXPR counter++ VAL [counter=42, counter++=41, v=-29, X=197, x=41, x=0, x=80, y=0, Y=2] [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=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=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=197, x=0, x=41, x=82, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=42, v=-29, X=197, x=41, x=0, 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=42, x=82, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=43, counter++=42, v=-25, X=197, x=82, x=0, x=42, 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=0, x=42, X=197, x=84, Y=2, y=0] [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=84, X=197, x=0, x=42, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=43, v=-25, X=197, x=0, x=42, x=84, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=43, v=-21, x=84, x=0, X=197, x=42, y=0, Y=2] [L45] x++ VAL [counter=43, v=-21, x=43, X=197, x=84, x=0, y=0, Y=2] [L31] EXPR counter++ VAL [counter=44, counter++=43, v=-21, x=0, x=84, x=43, 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=44, v=-21, x=86, x=0, x=43, 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=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=197, x=43, x=86, x=0, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=44, v=-21, x=43, X=197, x=86, x=0, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=44, v=-17, x=86, x=0, x=43, X=197, Y=2, y=0] [L45] x++ VAL [counter=44, v=-17, x=44, x=86, x=0, X=197, y=0, Y=2] [L31] EXPR counter++ VAL [counter=45, counter++=44, v=-17, x=86, x=44, 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=45, v=-17, x=44, x=0, 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=197, x=44, x=0, x=88, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=45, v=-17, x=0, X=197, x=44, x=88, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=45, v=-13, x=88, x=0, x=44, X=197, Y=2, y=0] [L45] x++ VAL [counter=45, v=-13, X=197, x=88, x=45, x=0, Y=2, y=0] [L31] EXPR counter++ VAL [counter=46, counter++=45, v=-13, x=0, X=197, x=45, x=88, 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=45, x=0, x=90, 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=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=197, x=0, x=45, x=90, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=46, v=-13, x=0, X=197, x=90, x=45, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=46, v=-9, x=90, x=45, X=197, x=0, Y=2, y=0] [L45] x++ VAL [counter=46, v=-9, x=46, X=197, x=0, x=90, Y=2, y=0] [L31] EXPR counter++ VAL [counter=47, counter++=46, v=-9, x=90, x=46, 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=47, v=-9, x=0, X=197, x=46, x=92, 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=46, x=0, x=92, X=197, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=47, v=-9, X=197, x=0, x=92, x=46, y=0, Y=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=47, v=-5, x=46, x=92, X=197, x=0, y=0, Y=2] [L45] x++ VAL [counter=47, v=-5, x=47, x=0, X=197, x=92, y=0, Y=2] [L31] EXPR counter++ VAL [counter=48, counter++=47, v=-5, x=0, x=92, X=197, 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=197, x=0, x=47, x=94, 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=94, X=197, x=0, x=47, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=48, v=-5, x=0, x=47, X=197, x=94, 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=2, y=0] [L45] x++ VAL [counter=48, v=-1, X=197, x=0, x=48, x=94, Y=2, y=0] [L31] EXPR counter++ VAL [counter=49, counter++=48, v=-1, x=48, x=0, X=197, x=94, Y=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [counter=49, v=-1, x=48, x=96, 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=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=197, x=0, x=48, x=96, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=49, v=-1, X=197, x=96, x=48, x=0, Y=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [counter=49, v=3, x=96, X=197, x=0, x=48, y=0, Y=2] [L45] x++ VAL [counter=49, v=3, x=96, x=0, X=197, x=49, y=0, Y=2] [L31] EXPR counter++ VAL [counter=50, counter++=49, v=3, x=96, X=197, x=49, 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=50, v=3, x=98, x=49, 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=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=98, X=197, x=0, x=49, Y=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [counter=50, v=3, x=0, X=197, x=49, x=98, Y=2, y=0] [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=2, y=1] [L45] x++ VAL [counter=50, v=-387, X=197, x=50, x=98, x=0, y=1, Y=2] [L31] EXPR counter++ VAL [counter=51, counter++=50, v=-387, X=197, x=50, x=98, x=0, y=1, Y=2] [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=50, x=100, X=197, y=1, Y=2] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=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: 14.0s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 828 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 827 mSDsluCounter, 1906 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1655 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1642 IncrementalHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 251 mSDtfsCounter, 1642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2440 GetRequests, 2043 SyntacticMatches, 45 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4422 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=9, InterpolantAutomatonStates: 331, 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, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2285 ConstructedInterpolants, 1 QuantifiedInterpolants, 6595 SizeOfPredicates, 109 NumberOfNonLiveVariables, 2581 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10288/31834 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-12-13 19:13:53,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f221810a-ac86-49f7-b38e-a6179113a455/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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