./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/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_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 02:05:14,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 02:05:14,747 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 02:05:14,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 02:05:14,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 02:05:14,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 02:05:14,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 02:05:14,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 02:05:14,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 02:05:14,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 02:05:14,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 02:05:14,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 02:05:14,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 02:05:14,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 02:05:14,785 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 02:05:14,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 02:05:14,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 02:05:14,786 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 02:05:14,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 02:05:14,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 02:05:14,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 02:05:14,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 02:05:14,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 02:05:14,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 02:05:14,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 02:05:14,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 02:05:14,787 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 02:05:14,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 02:05:14,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 02:05:14,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:05:14,787 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 02:05:14,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:05:14,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:05:14,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 02:05:14,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 02:05:14,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 02:05:14,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 02:05:14,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:05:14,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 02:05:14,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 02:05:14,791 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 02:05:14,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 02:05:14,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 02:05:14,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 02:05:14,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 02:05:14,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 02:05:14,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 02:05:14,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 02:05:14,792 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2024-11-24 02:05:15,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 02:05:15,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 02:05:15,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 02:05:15,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 02:05:15,130 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 02:05:15,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-11-24 02:05:18,062 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/data/637145b89/cc2c27297247450ea69cf89e08b3074a/FLAG1a7e1da92 [2024-11-24 02:05:18,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 02:05:18,329 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2024-11-24 02:05:18,349 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/data/637145b89/cc2c27297247450ea69cf89e08b3074a/FLAG1a7e1da92 [2024-11-24 02:05:18,365 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/data/637145b89/cc2c27297247450ea69cf89e08b3074a [2024-11-24 02:05:18,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 02:05:18,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 02:05:18,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 02:05:18,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 02:05:18,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 02:05:18,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3031e6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18, skipping insertion in model container [2024-11-24 02:05:18,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 02:05:18,565 WARN L250 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_63070daf-e7b4-4256-b631-c052ed0ba87b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2024-11-24 02:05:18,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:05:18,601 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 02:05:18,614 WARN L250 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_63070daf-e7b4-4256-b631-c052ed0ba87b/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2024-11-24 02:05:18,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 02:05:18,634 INFO L204 MainTranslator]: Completed translation [2024-11-24 02:05:18,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18 WrapperNode [2024-11-24 02:05:18,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 02:05:18,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 02:05:18,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 02:05:18,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 02:05:18,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,660 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-24 02:05:18,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 02:05:18,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 02:05:18,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 02:05:18,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 02:05:18,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,679 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 02:05:18,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 02:05:18,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 02:05:18,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 02:05:18,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 02:05:18,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (1/1) ... [2024-11-24 02:05:18,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 02:05:18,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:18,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 02:05:18,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 02:05:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 02:05:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 02:05:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 02:05:18,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 02:05:18,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-24 02:05:18,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-24 02:05:18,807 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 02:05:18,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 02:05:18,947 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-24 02:05:18,947 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 02:05:18,956 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 02:05:18,956 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-24 02:05:18,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:05:18 BoogieIcfgContainer [2024-11-24 02:05:18,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 02:05:18,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 02:05:18,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 02:05:18,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 02:05:18,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:05:18" (1/3) ... [2024-11-24 02:05:18,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0c651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:05:18, skipping insertion in model container [2024-11-24 02:05:18,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:05:18" (2/3) ... [2024-11-24 02:05:18,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0c651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:05:18, skipping insertion in model container [2024-11-24 02:05:18,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:05:18" (3/3) ... [2024-11-24 02:05:18,965 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2024-11-24 02:05:18,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 02:05:18,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound50.c that has 2 procedures, 21 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 02:05:19,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 02:05:19,045 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@77f224f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 02:05:19,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 02:05:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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) [2024-11-24 02:05:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-24 02:05:19,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:19,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:19,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:19,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash 798370362, now seen corresponding path program 1 times [2024-11-24 02:05:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:19,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896143253] [2024-11-24 02:05:19,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896143253] [2024-11-24 02:05:19,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896143253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:19,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:19,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 02:05:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902609152] [2024-11-24 02:05:19,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:19,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 02:05:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:19,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 02:05:19,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 02:05:19,234 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-11-24 02:05:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:19,251 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-24 02:05:19,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 02:05:19,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 [2024-11-24 02:05:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:19,258 INFO L225 Difference]: With dead ends: 40 [2024-11-24 02:05:19,258 INFO L226 Difference]: Without dead ends: 17 [2024-11-24 02:05:19,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 02:05:19,263 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:19,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 02:05:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-24 02:05:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-24 02:05:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 02:05:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-24 02:05:19,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2024-11-24 02:05:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:19,294 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-24 02:05:19,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2024-11-24 02:05:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-24 02:05:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-24 02:05:19,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:19,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:19,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 02:05:19,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 295298814, now seen corresponding path program 1 times [2024-11-24 02:05:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:19,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861463551] [2024-11-24 02:05:19,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 02:05:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047664982] [2024-11-24 02:05:19,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:19,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:19,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:19,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:19,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 02:05:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:19,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-24 02:05:19,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:19,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 02:05:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861463551] [2024-11-24 02:05:19,700 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 02:05:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047664982] [2024-11-24 02:05:19,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047664982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:19,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 02:05:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594858888] [2024-11-24 02:05:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:19,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:05:19,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:19,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:05:19,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:05:19,705 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-24 02:05:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:19,862 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-24 02:05:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 02:05:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 9 [2024-11-24 02:05:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:19,864 INFO L225 Difference]: With dead ends: 32 [2024-11-24 02:05:19,864 INFO L226 Difference]: Without dead ends: 30 [2024-11-24 02:05:19,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-24 02:05:19,865 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:19,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 02:05:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-24 02:05:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-24 02:05:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 02:05:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-24 02:05:19,877 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2024-11-24 02:05:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:19,878 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-24 02:05:19,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-24 02:05:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-24 02:05:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-24 02:05:19,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:19,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:19,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-24 02:05:20,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:20,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:20,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 368316555, now seen corresponding path program 1 times [2024-11-24 02:05:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:20,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295424903] [2024-11-24 02:05:20,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:20,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295424903] [2024-11-24 02:05:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295424903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:20,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:20,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 02:05:20,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502304109] [2024-11-24 02:05:20,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:20,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 02:05:20,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:20,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 02:05:20,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 02:05:20,199 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-24 02:05:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:20,216 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-24 02:05:20,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 02:05:20,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-11-24 02:05:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:20,219 INFO L225 Difference]: With dead ends: 33 [2024-11-24 02:05:20,219 INFO L226 Difference]: Without dead ends: 25 [2024-11-24 02:05:20,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 02:05:20,220 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:20,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 02:05:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-24 02:05:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-24 02:05:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 02:05:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-24 02:05:20,227 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2024-11-24 02:05:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:20,227 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-24 02:05:20,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-24 02:05:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-24 02:05:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 02:05:20,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:20,228 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:20,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 02:05:20,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:20,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash -156697420, now seen corresponding path program 1 times [2024-11-24 02:05:20,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:20,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902019553] [2024-11-24 02:05:20,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:20,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 02:05:20,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509760229] [2024-11-24 02:05:20,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:20,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:20,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:20,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:20,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 02:05:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:20,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-24 02:05:20,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:20,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 02:05:20,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902019553] [2024-11-24 02:05:20,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 02:05:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509760229] [2024-11-24 02:05:20,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509760229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 02:05:20,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 02:05:20,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 02:05:20,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605286503] [2024-11-24 02:05:20,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 02:05:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 02:05:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:20,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 02:05:20,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 02:05:20,530 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 02:05:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:20,643 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-24 02:05:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 02:05:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-24 02:05:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:20,644 INFO L225 Difference]: With dead ends: 35 [2024-11-24 02:05:20,644 INFO L226 Difference]: Without dead ends: 27 [2024-11-24 02:05:20,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-24 02:05:20,647 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:20,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 02:05:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-24 02:05:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-24 02:05:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 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) [2024-11-24 02:05:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-24 02:05:20,657 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2024-11-24 02:05:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-24 02:05:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-24 02:05:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-24 02:05:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-24 02:05:20,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:20,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:20,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 02:05:20,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:20,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:20,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash -716773380, now seen corresponding path program 1 times [2024-11-24 02:05:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919670094] [2024-11-24 02:05:20,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 02:05:20,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [411226633] [2024-11-24 02:05:20,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:20,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:20,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:20,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:20,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 02:05:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:20,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-24 02:05:20,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:21,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:05:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 02:05:21,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919670094] [2024-11-24 02:05:21,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 02:05:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411226633] [2024-11-24 02:05:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411226633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:21,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:05:21,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2024-11-24 02:05:21,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382222978] [2024-11-24 02:05:21,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:21,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 02:05:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:21,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 02:05:21,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-24 02:05:21,397 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 02:05:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:21,631 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-24 02:05:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 02:05:21,632 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-24 02:05:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:21,632 INFO L225 Difference]: With dead ends: 44 [2024-11-24 02:05:21,633 INFO L226 Difference]: Without dead ends: 40 [2024-11-24 02:05:21,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-24 02:05:21,634 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:21,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 02:05:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-24 02:05:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2024-11-24 02:05:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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) [2024-11-24 02:05:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-24 02:05:21,644 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2024-11-24 02:05:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:21,644 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-24 02:05:21,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-24 02:05:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-24 02:05:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-24 02:05:21,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:21,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:21,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 02:05:21,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:21,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:21,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:21,847 INFO L85 PathProgramCache]: Analyzing trace with hash -643755639, now seen corresponding path program 1 times [2024-11-24 02:05:21,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:21,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342962174] [2024-11-24 02:05:21,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:21,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342962174] [2024-11-24 02:05:21,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342962174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:05:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407347519] [2024-11-24 02:05:21,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:21,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:21,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:21,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:21,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 02:05:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:22,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-24 02:05:22,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:22,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:05:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407347519] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:22,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 02:05:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2024-11-24 02:05:22,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316304576] [2024-11-24 02:05:22,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:22,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 02:05:22,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:22,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 02:05:22,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-24 02:05:22,130 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-24 02:05:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:22,228 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-24 02:05:22,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 02:05:22,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-24 02:05:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:22,230 INFO L225 Difference]: With dead ends: 72 [2024-11-24 02:05:22,230 INFO L226 Difference]: Without dead ends: 66 [2024-11-24 02:05:22,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-24 02:05:22,231 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:22,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 02:05:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-24 02:05:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-11-24 02:05:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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) [2024-11-24 02:05:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2024-11-24 02:05:22,254 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 20 [2024-11-24 02:05:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:22,255 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2024-11-24 02:05:22,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-24 02:05:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2024-11-24 02:05:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-24 02:05:22,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:22,256 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:22,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 02:05:22,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-24 02:05:22,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:22,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash 935756278, now seen corresponding path program 1 times [2024-11-24 02:05:22,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:22,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153047420] [2024-11-24 02:05:22,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:22,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 02:05:22,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184326608] [2024-11-24 02:05:22,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:22,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:22,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:22,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:22,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 02:05:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:22,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-24 02:05:22,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 02:05:22,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:05:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-24 02:05:23,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:23,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153047420] [2024-11-24 02:05:23,024 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 02:05:23,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184326608] [2024-11-24 02:05:23,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184326608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:23,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:05:23,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-24 02:05:23,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649969503] [2024-11-24 02:05:23,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:23,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 02:05:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:23,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 02:05:23,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-24 02:05:23,028 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 02:05:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:23,253 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-11-24 02:05:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 02:05:23,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2024-11-24 02:05:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:23,255 INFO L225 Difference]: With dead ends: 86 [2024-11-24 02:05:23,255 INFO L226 Difference]: Without dead ends: 80 [2024-11-24 02:05:23,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-24 02:05:23,258 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:23,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 99 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 02:05:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-24 02:05:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-24 02:05:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 states have internal predecessors, (77), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-24 02:05:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-11-24 02:05:23,299 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 27 [2024-11-24 02:05:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-24 02:05:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.5) internal successors, (25), 13 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-24 02:05:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-11-24 02:05:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-24 02:05:23,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:23,304 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:23,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-24 02:05:23,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-24 02:05:23,505 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash -85312076, now seen corresponding path program 1 times [2024-11-24 02:05:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277818754] [2024-11-24 02:05:23,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 02:05:23,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543799388] [2024-11-24 02:05:23,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:23,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:23,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:23,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:23,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 02:05:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:23,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-24 02:05:23,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-24 02:05:23,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:05:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-24 02:05:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277818754] [2024-11-24 02:05:24,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 02:05:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543799388] [2024-11-24 02:05:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543799388] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:24,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-24 02:05:24,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2024-11-24 02:05:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136717846] [2024-11-24 02:05:24,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:24,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-24 02:05:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:24,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-24 02:05:24,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-24 02:05:24,381 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 02:05:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:25,258 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-11-24 02:05:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-24 02:05:25,259 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2024-11-24 02:05:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:25,261 INFO L225 Difference]: With dead ends: 87 [2024-11-24 02:05:25,261 INFO L226 Difference]: Without dead ends: 79 [2024-11-24 02:05:25,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2024-11-24 02:05:25,264 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:25,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 169 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 02:05:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-24 02:05:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2024-11-24 02:05:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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) [2024-11-24 02:05:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-11-24 02:05:25,286 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 27 [2024-11-24 02:05:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:25,287 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-24 02:05:25,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-24 02:05:25,287 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-11-24 02:05:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-24 02:05:25,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:25,288 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:25,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-24 02:05:25,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:25,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:25,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:25,492 INFO L85 PathProgramCache]: Analyzing trace with hash 380685067, now seen corresponding path program 2 times [2024-11-24 02:05:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:25,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288151244] [2024-11-24 02:05:25,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:05:25,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:25,517 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 02:05:25,518 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:05:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-24 02:05:25,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:25,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288151244] [2024-11-24 02:05:25,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288151244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:05:25,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534063704] [2024-11-24 02:05:25,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:05:25,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:25,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:25,846 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:25,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-24 02:05:25,919 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 02:05:25,919 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:05:25,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-24 02:05:25,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:26,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:05:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-24 02:05:26,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534063704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:26,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 02:05:26,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2024-11-24 02:05:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073250421] [2024-11-24 02:05:26,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:26,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 02:05:26,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:26,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 02:05:26,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2024-11-24 02:05:26,180 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-24 02:05:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:26,403 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2024-11-24 02:05:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-24 02:05:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 53 [2024-11-24 02:05:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:26,405 INFO L225 Difference]: With dead ends: 126 [2024-11-24 02:05:26,405 INFO L226 Difference]: Without dead ends: 120 [2024-11-24 02:05:26,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2024-11-24 02:05:26,406 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:26,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 129 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 02:05:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-24 02:05:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-24 02:05:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.1122448979591837) internal successors, (109), 98 states have internal predecessors, (109), 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) [2024-11-24 02:05:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2024-11-24 02:05:26,456 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 53 [2024-11-24 02:05:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:26,456 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2024-11-24 02:05:26,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-24 02:05:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2024-11-24 02:05:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 02:05:26,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:26,462 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:26,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-24 02:05:26,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:26,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:26,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1638130997, now seen corresponding path program 3 times [2024-11-24 02:05:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:26,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115633075] [2024-11-24 02:05:26,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 02:05:26,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:26,812 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-24 02:05:26,812 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:05:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 20 proven. 335 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-24 02:05:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:28,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115633075] [2024-11-24 02:05:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115633075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:05:28,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169529098] [2024-11-24 02:05:28,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 02:05:28,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:28,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:28,121 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:28,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-24 02:05:28,184 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-24 02:05:28,184 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:05:28,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-24 02:05:28,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-24 02:05:28,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:05:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-24 02:05:29,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169529098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:29,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 02:05:29,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 12] total 37 [2024-11-24 02:05:29,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913906477] [2024-11-24 02:05:29,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:29,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-24 02:05:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:29,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-24 02:05:29,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2024-11-24 02:05:29,184 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-24 02:05:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:33,100 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2024-11-24 02:05:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-24 02:05:33,101 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 119 [2024-11-24 02:05:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:33,103 INFO L225 Difference]: With dead ends: 254 [2024-11-24 02:05:33,103 INFO L226 Difference]: Without dead ends: 244 [2024-11-24 02:05:33,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4856 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2195, Invalid=13555, Unknown=0, NotChecked=0, Total=15750 [2024-11-24 02:05:33,115 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 251 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:33,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 127 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 02:05:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-24 02:05:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2024-11-24 02:05:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 197 states have (on average 1.1116751269035532) internal successors, (219), 197 states have internal predecessors, (219), 22 states have call successors, (22), 22 states have call predecessors, (22), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-24 02:05:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2024-11-24 02:05:33,198 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 119 [2024-11-24 02:05:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:33,199 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2024-11-24 02:05:33,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 36 states have internal predecessors, (100), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-24 02:05:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2024-11-24 02:05:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-24 02:05:33,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:33,205 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:33,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-24 02:05:33,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-24 02:05:33,409 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:33,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:33,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2053046965, now seen corresponding path program 1 times [2024-11-24 02:05:33,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:33,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509625607] [2024-11-24 02:05:33,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:33,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-24 02:05:34,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509625607] [2024-11-24 02:05:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509625607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:05:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651283170] [2024-11-24 02:05:34,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 02:05:34,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:34,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:34,138 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:34,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-24 02:05:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 02:05:34,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-24 02:05:34,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:34,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:05:34,995 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 22 proven. 407 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-24 02:05:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651283170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:34,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 02:05:34,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 28 [2024-11-24 02:05:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796057407] [2024-11-24 02:05:34,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-24 02:05:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:34,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-24 02:05:34,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-11-24 02:05:34,999 INFO L87 Difference]: Start difference. First operand 241 states and 262 transitions. Second operand has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-24 02:05:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:35,805 INFO L93 Difference]: Finished difference Result 536 states and 595 transitions. [2024-11-24 02:05:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-24 02:05:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) Word has length 130 [2024-11-24 02:05:35,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:35,809 INFO L225 Difference]: With dead ends: 536 [2024-11-24 02:05:35,809 INFO L226 Difference]: Without dead ends: 530 [2024-11-24 02:05:35,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=940, Invalid=1610, Unknown=0, NotChecked=0, Total=2550 [2024-11-24 02:05:35,812 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 143 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:35,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 266 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 02:05:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-24 02:05:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 527. [2024-11-24 02:05:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 431 states have (on average 1.111368909512761) internal successors, (479), 431 states have internal predecessors, (479), 48 states have call successors, (48), 48 states have call predecessors, (48), 47 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-24 02:05:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 574 transitions. [2024-11-24 02:05:35,918 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 574 transitions. Word has length 130 [2024-11-24 02:05:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:35,919 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 574 transitions. [2024-11-24 02:05:35,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 23 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (33), 22 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-24 02:05:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 574 transitions. [2024-11-24 02:05:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-24 02:05:35,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:35,924 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:35,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-24 02:05:36,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:36,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:36,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash 182128013, now seen corresponding path program 2 times [2024-11-24 02:05:36,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:36,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394229882] [2024-11-24 02:05:36,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:05:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:36,215 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 02:05:36,215 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:05:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 02:05:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 02:05:38,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394229882] [2024-11-24 02:05:38,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394229882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 02:05:38,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565373886] [2024-11-24 02:05:38,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 02:05:38,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:38,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:38,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:38,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-24 02:05:38,416 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 02:05:38,416 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 02:05:38,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-24 02:05:38,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 02:05:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 3084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 02:05:38,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 02:05:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3132 backedges. 48 proven. 1980 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-24 02:05:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565373886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 02:05:40,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 02:05:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 55 [2024-11-24 02:05:40,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794317025] [2024-11-24 02:05:40,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 02:05:40,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-24 02:05:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 02:05:40,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-24 02:05:40,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1361, Invalid=1609, Unknown=0, NotChecked=0, Total=2970 [2024-11-24 02:05:40,241 INFO L87 Difference]: Start difference. First operand 527 states and 574 transitions. Second operand has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-24 02:05:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 02:05:42,137 INFO L93 Difference]: Finished difference Result 1108 states and 1232 transitions. [2024-11-24 02:05:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-24 02:05:42,137 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) Word has length 273 [2024-11-24 02:05:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 02:05:42,144 INFO L225 Difference]: With dead ends: 1108 [2024-11-24 02:05:42,144 INFO L226 Difference]: Without dead ends: 1102 [2024-11-24 02:05:42,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3904, Invalid=6602, Unknown=0, NotChecked=0, Total=10506 [2024-11-24 02:05:42,148 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 322 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 02:05:42,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 469 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 02:05:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-24 02:05:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1099. [2024-11-24 02:05:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 899 states have (on average 1.1112347052280311) internal successors, (999), 899 states have internal predecessors, (999), 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) [2024-11-24 02:05:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1198 transitions. [2024-11-24 02:05:42,333 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1198 transitions. Word has length 273 [2024-11-24 02:05:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 02:05:42,334 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1198 transitions. [2024-11-24 02:05:42,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 6.8545454545454545) internal successors, (377), 55 states have internal predecessors, (377), 49 states have call successors, (73), 26 states have call predecessors, (73), 25 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2024-11-24 02:05:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1198 transitions. [2024-11-24 02:05:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2024-11-24 02:05:42,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 02:05:42,348 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:42,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-24 02:05:42,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:42,548 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 02:05:42,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 02:05:42,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1615446477, now seen corresponding path program 3 times [2024-11-24 02:05:42,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 02:05:42,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301822641] [2024-11-24 02:05:42,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 02:05:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 02:05:43,320 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-24 02:05:43,320 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-24 02:05:43,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220151857] [2024-11-24 02:05:43,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 02:05:43,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 02:05:43,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 02:05:43,329 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 02:05:43,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-24 02:05:43,897 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2024-11-24 02:05:43,897 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-24 02:05:43,898 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 02:05:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 02:05:44,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 02:05:44,345 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 02:05:44,346 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 02:05:44,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-24 02:05:44,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-24 02:05:44,551 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 02:05:44,724 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 02:05:44,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 02:05:44 BoogieIcfgContainer [2024-11-24 02:05:44,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 02:05:44,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 02:05:44,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 02:05:44,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 02:05:44,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:05:18" (3/4) ... [2024-11-24 02:05:44,731 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-24 02:05:44,990 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 304. [2024-11-24 02:05:45,218 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-24 02:05:45,218 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-24 02:05:45,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 02:05:45,221 INFO L158 Benchmark]: Toolchain (without parser) took 26850.59ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 94.9MB in the beginning and 326.9MB in the end (delta: -231.9MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2024-11-24 02:05:45,221 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 02:05:45,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.88ms. Allocated memory is still 117.4MB. Free memory was 94.9MB in the beginning and 83.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 02:05:45,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.46ms. Allocated memory is still 117.4MB. Free memory was 83.7MB in the beginning and 82.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 02:05:45,222 INFO L158 Benchmark]: Boogie Preprocessor took 29.81ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 81.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 02:05:45,222 INFO L158 Benchmark]: RCFGBuilder took 266.14ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 70.7MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 02:05:45,222 INFO L158 Benchmark]: TraceAbstraction took 25769.20ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 70.1MB in the beginning and 360.4MB in the end (delta: -290.3MB). Peak memory consumption was 190.5MB. Max. memory is 16.1GB. [2024-11-24 02:05:45,223 INFO L158 Benchmark]: Witness Printer took 490.04ms. Allocated memory is still 427.8MB. Free memory was 360.4MB in the beginning and 326.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-24 02:05:45,225 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.88ms. Allocated memory is still 117.4MB. Free memory was 94.9MB in the beginning and 83.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.46ms. Allocated memory is still 117.4MB. Free memory was 83.7MB in the beginning and 82.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.81ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 81.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 266.14ms. Allocated memory is still 117.4MB. Free memory was 81.1MB in the beginning and 70.7MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25769.20ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 70.1MB in the beginning and 360.4MB in the end (delta: -290.3MB). Peak memory consumption was 190.5MB. Max. memory is 16.1GB. * Witness Printer took 490.04ms. Allocated memory is still 427.8MB. Free memory was 360.4MB in the beginning and 326.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. 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 [X=197, Y=2, counter=0, v=-193, x=0, y=0] [L31] EXPR counter++ VAL [X=197, Y=2, counter=1, v=-193, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [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, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=1, v=-193, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=1, v=-189, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=197, Y=2, counter=1, v=-189, x=1, xy=0, y=0, yx=0] [L31] EXPR counter++ VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=2, v=-189, x=1, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=2, v=-185, x=1, xy=0, y=0, yx=2] [L45] x++ VAL [X=197, Y=2, counter=2, v=-185, x=2, xy=0, y=0, yx=2] [L31] EXPR counter++ VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=2] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [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, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=3, v=-185, x=2, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=3, v=-181, x=2, xy=0, y=0, yx=4] [L45] x++ VAL [X=197, Y=2, counter=3, v=-181, x=3, xy=0, y=0, yx=4] [L31] EXPR counter++ VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=4] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [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, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=4, v=-181, x=3, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=4, v=-177, x=3, xy=0, y=0, yx=6] [L45] x++ VAL [X=197, Y=2, counter=4, v=-177, x=4, xy=0, y=0, yx=6] [L31] EXPR counter++ VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=6] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [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, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=5, v=-177, x=4, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=5, v=-173, x=4, xy=0, y=0, yx=8] [L45] x++ VAL [X=197, Y=2, counter=5, v=-173, x=5, xy=0, y=0, yx=8] [L31] EXPR counter++ VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=8] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [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, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=6, v=-173, x=5, xy=0, y=0, yx=10] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=6, v=-169, x=5, xy=0, y=0, yx=10] [L45] x++ VAL [X=197, Y=2, counter=6, v=-169, x=6, xy=0, y=0, yx=10] [L31] EXPR counter++ VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=10] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [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, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=7, v=-169, x=6, xy=0, y=0, yx=12] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=7, v=-165, x=6, xy=0, y=0, yx=12] [L45] x++ VAL [X=197, Y=2, counter=7, v=-165, x=7, xy=0, y=0, yx=12] [L31] EXPR counter++ VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=12] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [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, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=8, v=-165, x=7, xy=0, y=0, yx=14] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=8, v=-161, x=7, xy=0, y=0, yx=14] [L45] x++ VAL [X=197, Y=2, counter=8, v=-161, x=8, xy=0, y=0, yx=14] [L31] EXPR counter++ VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=14] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [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, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=9, v=-161, x=8, xy=0, y=0, yx=16] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=9, v=-157, x=8, xy=0, y=0, yx=16] [L45] x++ VAL [X=197, Y=2, counter=9, v=-157, x=9, xy=0, y=0, yx=16] [L31] EXPR counter++ VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=16] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [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, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=10, v=-157, x=9, xy=0, y=0, yx=18] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=10, v=-153, x=9, xy=0, y=0, yx=18] [L45] x++ VAL [X=197, Y=2, counter=10, v=-153, x=10, xy=0, y=0, yx=18] [L31] EXPR counter++ VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=18] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [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, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=11, v=-153, x=10, xy=0, y=0, yx=20] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=11, v=-149, x=10, xy=0, y=0, yx=20] [L45] x++ VAL [X=197, Y=2, counter=11, v=-149, x=11, xy=0, y=0, yx=20] [L31] EXPR counter++ VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=20] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [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, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=12, v=-149, x=11, xy=0, y=0, yx=22] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=12, v=-145, x=11, xy=0, y=0, yx=22] [L45] x++ VAL [X=197, Y=2, counter=12, v=-145, x=12, xy=0, y=0, yx=22] [L31] EXPR counter++ VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=22] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [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, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=13, v=-145, x=12, xy=0, y=0, yx=24] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=13, v=-141, x=12, xy=0, y=0, yx=24] [L45] x++ VAL [X=197, Y=2, counter=13, v=-141, x=13, xy=0, y=0, yx=24] [L31] EXPR counter++ VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=24] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [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, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=14, v=-141, x=13, xy=0, y=0, yx=26] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=14, v=-137, x=13, xy=0, y=0, yx=26] [L45] x++ VAL [X=197, Y=2, counter=14, v=-137, x=14, xy=0, y=0, yx=26] [L31] EXPR counter++ VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=26] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [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, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=15, v=-137, x=14, xy=0, y=0, yx=28] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=15, v=-133, x=14, xy=0, y=0, yx=28] [L45] x++ VAL [X=197, Y=2, counter=15, v=-133, x=15, xy=0, y=0, yx=28] [L31] EXPR counter++ VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=28] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [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, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=16, v=-133, x=15, xy=0, y=0, yx=30] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=16, v=-129, x=15, xy=0, y=0, yx=30] [L45] x++ VAL [X=197, Y=2, counter=16, v=-129, x=16, xy=0, y=0, yx=30] [L31] EXPR counter++ VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=30] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [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, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=17, v=-129, x=16, xy=0, y=0, yx=32] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=17, v=-125, x=16, xy=0, y=0, yx=32] [L45] x++ VAL [X=197, Y=2, counter=17, v=-125, x=17, xy=0, y=0, yx=32] [L31] EXPR counter++ VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=32] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [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, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=18, v=-125, x=17, xy=0, y=0, yx=34] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=18, v=-121, x=17, xy=0, y=0, yx=34] [L45] x++ VAL [X=197, Y=2, counter=18, v=-121, x=18, xy=0, y=0, yx=34] [L31] EXPR counter++ VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=34] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [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, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=19, v=-121, x=18, xy=0, y=0, yx=36] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=19, v=-117, x=18, xy=0, y=0, yx=36] [L45] x++ VAL [X=197, Y=2, counter=19, v=-117, x=19, xy=0, y=0, yx=36] [L31] EXPR counter++ VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=36] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [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, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=20, v=-117, x=19, xy=0, y=0, yx=38] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=20, v=-113, x=19, xy=0, y=0, yx=38] [L45] x++ VAL [X=197, Y=2, counter=20, v=-113, x=20, xy=0, y=0, yx=38] [L31] EXPR counter++ VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=38] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [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, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=21, v=-113, x=20, xy=0, y=0, yx=40] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=21, v=-109, x=20, xy=0, y=0, yx=40] [L45] x++ VAL [X=197, Y=2, counter=21, v=-109, x=21, xy=0, y=0, yx=40] [L31] EXPR counter++ VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=40] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [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, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=22, v=-109, x=21, xy=0, y=0, yx=42] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=22, v=-105, x=21, xy=0, y=0, yx=42] [L45] x++ VAL [X=197, Y=2, counter=22, v=-105, x=22, xy=0, y=0, yx=42] [L31] EXPR counter++ VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=42] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [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, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=23, v=-105, x=22, xy=0, y=0, yx=44] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=23, v=-101, x=22, xy=0, y=0, yx=44] [L45] x++ VAL [X=197, Y=2, counter=23, v=-101, x=23, xy=0, y=0, yx=44] [L31] EXPR counter++ VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=44] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [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, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=24, v=-101, x=23, xy=0, y=0, yx=46] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=24, v=-97, x=23, xy=0, y=0, yx=46] [L45] x++ VAL [X=197, Y=2, counter=24, v=-97, x=24, xy=0, y=0, yx=46] [L31] EXPR counter++ VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=46] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [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, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=25, v=-97, x=24, xy=0, y=0, yx=48] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=25, v=-93, x=24, xy=0, y=0, yx=48] [L45] x++ VAL [X=197, Y=2, counter=25, v=-93, x=25, xy=0, y=0, yx=48] [L31] EXPR counter++ VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=48] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [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, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=26, v=-93, x=25, xy=0, y=0, yx=50] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=26, v=-89, x=25, xy=0, y=0, yx=50] [L45] x++ VAL [X=197, Y=2, counter=26, v=-89, x=26, xy=0, y=0, yx=50] [L31] EXPR counter++ VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=50] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [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, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=27, v=-89, x=26, xy=0, y=0, yx=52] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=27, v=-85, x=26, xy=0, y=0, yx=52] [L45] x++ VAL [X=197, Y=2, counter=27, v=-85, x=27, xy=0, y=0, yx=52] [L31] EXPR counter++ VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=52] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [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, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=28, v=-85, x=27, xy=0, y=0, yx=54] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=28, v=-81, x=27, xy=0, y=0, yx=54] [L45] x++ VAL [X=197, Y=2, counter=28, v=-81, x=28, xy=0, y=0, yx=54] [L31] EXPR counter++ VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=54] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [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, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=29, v=-81, x=28, xy=0, y=0, yx=56] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=29, v=-77, x=28, xy=0, y=0, yx=56] [L45] x++ VAL [X=197, Y=2, counter=29, v=-77, x=29, xy=0, y=0, yx=56] [L31] EXPR counter++ VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=56] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [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, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=30, v=-77, x=29, xy=0, y=0, yx=58] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=30, v=-73, x=29, xy=0, y=0, yx=58] [L45] x++ VAL [X=197, Y=2, counter=30, v=-73, x=30, xy=0, y=0, yx=58] [L31] EXPR counter++ VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=58] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [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, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=31, v=-73, x=30, xy=0, y=0, yx=60] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=31, v=-69, x=30, xy=0, y=0, yx=60] [L45] x++ VAL [X=197, Y=2, counter=31, v=-69, x=31, xy=0, y=0, yx=60] [L31] EXPR counter++ VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=60] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [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, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=32, v=-69, x=31, xy=0, y=0, yx=62] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=32, v=-65, x=31, xy=0, y=0, yx=62] [L45] x++ VAL [X=197, Y=2, counter=32, v=-65, x=32, xy=0, y=0, yx=62] [L31] EXPR counter++ VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=62] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [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, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=33, v=-65, x=32, xy=0, y=0, yx=64] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=33, v=-61, x=32, xy=0, y=0, yx=64] [L45] x++ VAL [X=197, Y=2, counter=33, v=-61, x=33, xy=0, y=0, yx=64] [L31] EXPR counter++ VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=64] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [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, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=34, v=-61, x=33, xy=0, y=0, yx=66] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=34, v=-57, x=33, xy=0, y=0, yx=66] [L45] x++ VAL [X=197, Y=2, counter=34, v=-57, x=34, xy=0, y=0, yx=66] [L31] EXPR counter++ VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=66] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [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, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=35, v=-57, x=34, xy=0, y=0, yx=68] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=35, v=-53, x=34, xy=0, y=0, yx=68] [L45] x++ VAL [X=197, Y=2, counter=35, v=-53, x=35, xy=0, y=0, yx=68] [L31] EXPR counter++ VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=68] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [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, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=36, v=-53, x=35, xy=0, y=0, yx=70] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=36, v=-49, x=35, xy=0, y=0, yx=70] [L45] x++ VAL [X=197, Y=2, counter=36, v=-49, x=36, xy=0, y=0, yx=70] [L31] EXPR counter++ VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=70] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [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, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=37, v=-49, x=36, xy=0, y=0, yx=72] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=37, v=-45, x=36, xy=0, y=0, yx=72] [L45] x++ VAL [X=197, Y=2, counter=37, v=-45, x=37, xy=0, y=0, yx=72] [L31] EXPR counter++ VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=72] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [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, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=38, v=-45, x=37, xy=0, y=0, yx=74] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=38, v=-41, x=37, xy=0, y=0, yx=74] [L45] x++ VAL [X=197, Y=2, counter=38, v=-41, x=38, xy=0, y=0, yx=74] [L31] EXPR counter++ VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=74] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [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, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=39, v=-41, x=38, xy=0, y=0, yx=76] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=39, v=-37, x=38, xy=0, y=0, yx=76] [L45] x++ VAL [X=197, Y=2, counter=39, v=-37, x=39, xy=0, y=0, yx=76] [L31] EXPR counter++ VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=76] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [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, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=40, v=-37, x=39, xy=0, y=0, yx=78] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=40, v=-33, x=39, xy=0, y=0, yx=78] [L45] x++ VAL [X=197, Y=2, counter=40, v=-33, x=40, xy=0, y=0, yx=78] [L31] EXPR counter++ VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=78] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [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, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=41, v=-33, x=40, xy=0, y=0, yx=80] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=41, v=-29, x=40, xy=0, y=0, yx=80] [L45] x++ VAL [X=197, Y=2, counter=41, v=-29, x=41, xy=0, y=0, yx=80] [L31] EXPR counter++ VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=80] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [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, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=42, v=-29, x=41, xy=0, y=0, yx=82] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=42, v=-25, x=41, xy=0, y=0, yx=82] [L45] x++ VAL [X=197, Y=2, counter=42, v=-25, x=42, xy=0, y=0, yx=82] [L31] EXPR counter++ VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=82] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [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, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=43, v=-25, x=42, xy=0, y=0, yx=84] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=43, v=-21, x=42, xy=0, y=0, yx=84] [L45] x++ VAL [X=197, Y=2, counter=43, v=-21, x=43, xy=0, y=0, yx=84] [L31] EXPR counter++ VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=84] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [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, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=44, v=-21, x=43, xy=0, y=0, yx=86] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=44, v=-17, x=43, xy=0, y=0, yx=86] [L45] x++ VAL [X=197, Y=2, counter=44, v=-17, x=44, xy=0, y=0, yx=86] [L31] EXPR counter++ VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=86] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [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, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=45, v=-17, x=44, xy=0, y=0, yx=88] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=45, v=-13, x=44, xy=0, y=0, yx=88] [L45] x++ VAL [X=197, Y=2, counter=45, v=-13, x=45, xy=0, y=0, yx=88] [L31] EXPR counter++ VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=88] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [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, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=46, v=-13, x=45, xy=0, y=0, yx=90] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=46, v=-9, x=45, xy=0, y=0, yx=90] [L45] x++ VAL [X=197, Y=2, counter=46, v=-9, x=46, xy=0, y=0, yx=90] [L31] EXPR counter++ VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=90] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [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, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=47, v=-9, x=46, xy=0, y=0, yx=92] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=47, v=-5, x=46, xy=0, y=0, yx=92] [L45] x++ VAL [X=197, Y=2, counter=47, v=-5, x=47, xy=0, y=0, yx=92] [L31] EXPR counter++ VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=92] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [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, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=48, v=-5, x=47, xy=0, y=0, yx=94] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=48, v=-1, x=47, xy=0, y=0, yx=94] [L45] x++ VAL [X=197, Y=2, counter=48, v=-1, x=48, xy=0, y=0, yx=94] [L31] EXPR counter++ VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=94] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [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, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=49, v=-1, x=48, xy=0, y=0, yx=96] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=197, Y=2, counter=49, v=3, x=48, xy=0, y=0, yx=96] [L45] x++ VAL [X=197, Y=2, counter=49, v=3, x=49, xy=0, y=0, yx=96] [L31] EXPR counter++ VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=96] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [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, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L35] COND FALSE !(!(x <= X)) VAL [X=197, Y=2, counter=50, v=3, x=49, xy=0, y=0, yx=98] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=197, Y=2, counter=50, v=-387, x=49, xy=0, y=1, yx=98] [L45] x++ VAL [X=197, Y=2, counter=50, v=-387, x=50, xy=0, y=1, yx=98] [L31] EXPR counter++ VAL [X=197, Y=2, counter=51, v=-387, x=50, xy=0, y=1, yx=98] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=197, Y=2, counter=51, v=-387, xy=50, y=1, yx=100] [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, counter=51] [L16] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 13, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 891 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 1593 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1416 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1336 IncrementalHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 177 mSDtfsCounter, 1336 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 1238 SyntacticMatches, 10 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7654 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1099occurred in iteration=12, InterpolantAutomatonStates: 366, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 66 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 2523 NumberOfCodeBlocks, 2424 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 1950 ConstructedInterpolants, 2 QuantifiedInterpolants, 5829 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1614 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 4198/13272 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-24 02:05:45,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63070daf-e7b4-4256-b631-c052ed0ba87b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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