./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB --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 64bit --witnessprinter.graph.data.programhash 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:22:09,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:22:09,795 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-28 03:22:09,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:22:09,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:22:09,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:22:09,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:22:09,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:22:09,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:22:09,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:22:09,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:22:09,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:22:09,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:22:09,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:22:09,835 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:22:09,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:22:09,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:22:09,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:22:09,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:22:09,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:22:09,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:22:09,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:22:09,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:22:09,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:22:09,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:22:09,837 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:22:09,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:22:09,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:22:09,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:22:09,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:22:09,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:22:09,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:22:09,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:22:09,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:22:09,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:22:09,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:22:09,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:22:09,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:22:09,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:22:09,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:22:09,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:22:09,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:22:09,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:22:09,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:22:09,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:22:09,840 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_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 [2024-11-28 03:22:10,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:22:10,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:22:10,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:22:10,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:22:10,260 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:22:10,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-28 03:22:13,708 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data/4ae9c4ed8/312da50137b34da2a12eb6d5fd77c2f7/FLAG008b31221 [2024-11-28 03:22:14,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:22:14,040 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-28 03:22:14,083 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data/4ae9c4ed8/312da50137b34da2a12eb6d5fd77c2f7/FLAG008b31221 [2024-11-28 03:22:14,123 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data/4ae9c4ed8/312da50137b34da2a12eb6d5fd77c2f7 [2024-11-28 03:22:14,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:22:14,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:22:14,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:22:14,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:22:14,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:22:14,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76cd6735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14, skipping insertion in model container [2024-11-28 03:22:14,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:22:14,409 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_22f4427b-abac-4789-9eb6-a77796efad46/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-11-28 03:22:14,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:22:14,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:22:14,504 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_22f4427b-abac-4789-9eb6-a77796efad46/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-11-28 03:22:14,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:22:14,551 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:22:14,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14 WrapperNode [2024-11-28 03:22:14,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:22:14,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:22:14,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:22:14,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:22:14,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,633 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 195 [2024-11-28 03:22:14,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:22:14,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:22:14,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:22:14,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:22:14,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,695 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-28 03:22:14,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:22:14,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:22:14,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:22:14,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:22:14,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (1/1) ... [2024-11-28 03:22:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:22:14,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:14,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:22:14,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:22:14,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:22:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:22:14,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:22:14,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:22:14,967 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:22:14,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:22:15,723 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-28 03:22:15,723 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:22:15,736 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:22:15,736 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:22:15,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:15 BoogieIcfgContainer [2024-11-28 03:22:15,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:22:15,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:22:15,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:22:15,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:22:15,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:22:14" (1/3) ... [2024-11-28 03:22:15,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c997630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:22:15, skipping insertion in model container [2024-11-28 03:22:15,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:14" (2/3) ... [2024-11-28 03:22:15,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c997630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:22:15, skipping insertion in model container [2024-11-28 03:22:15,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:15" (3/3) ... [2024-11-28 03:22:15,753 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-28 03:22:15,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:22:15,773 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.dyn_partition.c that has 1 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:22:15,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:22:15,867 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;@6abb032f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:22:15,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:22:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-28 03:22:15,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:15,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:15,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:15,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash 379966597, now seen corresponding path program 1 times [2024-11-28 03:22:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:22:15,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145518213] [2024-11-28 03:22:15,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:15,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:22:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:16,613 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-28 03:22:16,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:22:16,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145518213] [2024-11-28 03:22:16,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145518213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:22:16,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:22:16,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:22:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537892868] [2024-11-28 03:22:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:22:16,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:22:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:22:16,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:22:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:22:16,646 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:16,708 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2024-11-28 03:22:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:22:16,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-28 03:22:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:16,724 INFO L225 Difference]: With dead ends: 89 [2024-11-28 03:22:16,724 INFO L226 Difference]: Without dead ends: 53 [2024-11-28 03:22:16,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-28 03:22:16,736 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:16,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:22:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-28 03:22:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-28 03:22:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-28 03:22:16,793 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 17 [2024-11-28 03:22:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:16,793 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-28 03:22:16,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-28 03:22:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-28 03:22:16,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:16,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:16,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:22:16,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:16,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:16,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1104242150, now seen corresponding path program 1 times [2024-11-28 03:22:16,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:22:16,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665351173] [2024-11-28 03:22:16,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:22:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:17,044 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-28 03:22:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:22:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665351173] [2024-11-28 03:22:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665351173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:22:17,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:22:17,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:22:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091257550] [2024-11-28 03:22:17,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:22:17,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:22:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:22:17,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:22:17,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:22:17,049 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:17,100 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-11-28 03:22:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:22:17,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-28 03:22:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:17,102 INFO L225 Difference]: With dead ends: 90 [2024-11-28 03:22:17,102 INFO L226 Difference]: Without dead ends: 55 [2024-11-28 03:22:17,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-28 03:22:17,104 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:17,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:22:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-28 03:22:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-28 03:22:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:17,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2024-11-28 03:22:17,112 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 18 [2024-11-28 03:22:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:17,113 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2024-11-28 03:22:17,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2024-11-28 03:22:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 03:22:17,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:17,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:17,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:22:17,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:17,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash -969734146, now seen corresponding path program 1 times [2024-11-28 03:22:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:22:17,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507675574] [2024-11-28 03:22:17,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:22:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:17,685 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-28 03:22:17,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:22:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507675574] [2024-11-28 03:22:17,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507675574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:22:17,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:22:17,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:22:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221651607] [2024-11-28 03:22:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:22:17,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:22:17,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:22:17,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:22:17,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:22:17,691 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:17,858 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions. [2024-11-28 03:22:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:22:17,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-28 03:22:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:17,861 INFO L225 Difference]: With dead ends: 111 [2024-11-28 03:22:17,861 INFO L226 Difference]: Without dead ends: 74 [2024-11-28 03:22:17,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:22:17,863 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 37 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:17,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 235 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:22:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-28 03:22:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2024-11-28 03:22:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2024-11-28 03:22:17,873 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 19 [2024-11-28 03:22:17,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:17,873 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2024-11-28 03:22:17,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2024-11-28 03:22:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:22:17,875 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:17,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:17,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:22:17,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:17,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1567557725, now seen corresponding path program 1 times [2024-11-28 03:22:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:22:17,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771458721] [2024-11-28 03:22:17,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:22:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:22:17,940 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:22:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:22:18,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:22:18,003 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:22:18,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:22:18,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:22:18,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-28 03:22:18,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:22:18,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:22:18 BoogieIcfgContainer [2024-11-28 03:22:18,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:22:18,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:22:18,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:22:18,067 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:22:18,068 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:15" (3/4) ... [2024-11-28 03:22:18,072 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:22:18,074 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:22:18,075 INFO L158 Benchmark]: Toolchain (without parser) took 3946.74ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 94.8MB in the beginning and 303.6MB in the end (delta: -208.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-28 03:22:18,076 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:22:18,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.73ms. Allocated memory is still 117.4MB. Free memory was 94.6MB in the beginning and 81.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:22:18,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.20ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 77.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:22:18,078 INFO L158 Benchmark]: Boogie Preprocessor took 108.59ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 74.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:22:18,078 INFO L158 Benchmark]: RCFGBuilder took 993.38ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 46.7MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:22:18,080 INFO L158 Benchmark]: TraceAbstraction took 2323.31ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 46.1MB in the beginning and 303.6MB in the end (delta: -257.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:22:18,080 INFO L158 Benchmark]: Witness Printer took 9.01ms. Allocated memory is still 352.3MB. Free memory was 303.6MB in the beginning and 303.6MB in the end (delta: 18.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:22:18,082 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.43ms. Allocated memory is still 142.6MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.73ms. Allocated memory is still 117.4MB. Free memory was 94.6MB in the beginning and 81.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.20ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 77.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.59ms. Allocated memory is still 117.4MB. Free memory was 77.1MB in the beginning and 74.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 993.38ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 46.7MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2323.31ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 46.1MB in the beginning and 303.6MB in the end (delta: -257.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 9.01ms. Allocated memory is still 352.3MB. Free memory was 303.6MB in the beginning and 303.6MB in the end (delta: 18.0kB). There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 69. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 645 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 437 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 208 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:22:18,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB --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 64bit --witnessprinter.graph.data.programhash 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:22:21,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:22:21,501 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-28 03:22:21,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:22:21,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:22:21,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:22:21,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:22:21,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:22:21,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:22:21,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:22:21,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:22:21,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:22:21,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:22:21,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:22:21,551 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:22:21,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:22:21,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:22:21,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:22:21,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:22:21,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:22:21,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:22:21,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:22:21,552 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:22:21,554 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:22:21,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:22:21,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:22:21,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:22:21,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:22:21,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:22:21,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:22:21,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:22:21,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:22:21,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:22:21,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:22:21,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:22:21,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:22:21,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:22:21,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:22:21,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:22:21,558 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:22:21,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:22:21,559 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:22:21,559 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:22:21,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:22:21,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:22:21,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:22:21,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:22:21,559 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_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 [2024-11-28 03:22:21,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:22:21,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:22:21,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:22:21,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:22:21,986 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:22:21,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-28 03:22:25,616 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data/e00081287/fd6bb1f0f3eb4548a8ef4dc8e7f50886/FLAG56e203176 [2024-11-28 03:22:25,931 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:22:25,933 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-28 03:22:25,946 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data/e00081287/fd6bb1f0f3eb4548a8ef4dc8e7f50886/FLAG56e203176 [2024-11-28 03:22:25,971 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/data/e00081287/fd6bb1f0f3eb4548a8ef4dc8e7f50886 [2024-11-28 03:22:25,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:22:25,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:22:25,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:22:25,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:22:25,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:22:25,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:22:25" (1/1) ... [2024-11-28 03:22:25,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3359c701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:25, skipping insertion in model container [2024-11-28 03:22:25,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:22:25" (1/1) ... [2024-11-28 03:22:26,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:22:26,208 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_22f4427b-abac-4789-9eb6-a77796efad46/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-11-28 03:22:26,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:22:26,312 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:22:26,326 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_22f4427b-abac-4789-9eb6-a77796efad46/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-11-28 03:22:26,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:22:26,400 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:22:26,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26 WrapperNode [2024-11-28 03:22:26,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:22:26,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:22:26,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:22:26,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:22:26,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,458 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2024-11-28 03:22:26,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:22:26,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:22:26,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:22:26,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:22:26,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,486 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-28 03:22:26,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:22:26,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:22:26,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:22:26,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:22:26,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (1/1) ... [2024-11-28 03:22:26,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:22:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:26,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:22:26,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:22:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:22:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:22:26,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:22:26,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:22:26,680 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:22:26,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:22:26,933 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-28 03:22:26,934 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:22:26,944 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:22:26,945 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:22:26,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:26 BoogieIcfgContainer [2024-11-28 03:22:26,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:22:26,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:22:26,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:22:26,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:22:26,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:22:25" (1/3) ... [2024-11-28 03:22:26,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c0bc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:22:26, skipping insertion in model container [2024-11-28 03:22:26,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:26" (2/3) ... [2024-11-28 03:22:26,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c0bc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:22:26, skipping insertion in model container [2024-11-28 03:22:26,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:26" (3/3) ... [2024-11-28 03:22:26,960 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-28 03:22:26,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:22:26,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.dyn_partition.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:22:27,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:22:27,067 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;@72f4bfc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:22:27,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:22:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-28 03:22:27,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:27,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-28 03:22:27,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:27,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-28 03:22:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:22:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1976791518] [2024-11-28 03:22:27,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:27,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:27,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:27,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:22:27,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:22:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:27,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 03:22:27,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:22:27,670 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-28 03:22:27,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:22:27,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:22:27,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976791518] [2024-11-28 03:22:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976791518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:22:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:22:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:22:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779398183] [2024-11-28 03:22:27,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:22:27,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:22:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:22:27,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:22:27,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:22:27,722 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:27,787 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-28 03:22:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:22:27,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-28 03:22:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:27,800 INFO L225 Difference]: With dead ends: 18 [2024-11-28 03:22:27,801 INFO L226 Difference]: Without dead ends: 10 [2024-11-28 03:22:27,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:22:27,810 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:27,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:22:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-28 03:22:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-28 03:22:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-28 03:22:27,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-28 03:22:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:27,854 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-28 03:22:27,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-28 03:22:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:22:27,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:27,856 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:27,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:22:28,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:28,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:28,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:28,062 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-28 03:22:28,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:22:28,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [373255954] [2024-11-28 03:22:28,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:22:28,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:28,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:28,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:22:28,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:22:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:22:28,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:22:28,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:22:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:22:28,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:22:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:22:29,632 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:22:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373255954] [2024-11-28 03:22:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373255954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:22:29,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:22:29,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-28 03:22:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424646230] [2024-11-28 03:22:29,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:22:29,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:22:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:22:29,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:22:29,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:22:29,639 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:29,777 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-28 03:22:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:22:29,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 03:22:29,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:29,779 INFO L225 Difference]: With dead ends: 15 [2024-11-28 03:22:29,780 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 03:22:29,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:22:29,781 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:29,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:22:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 03:22:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-28 03:22:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-28 03:22:29,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-28 03:22:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:29,790 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-28 03:22:29,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-28 03:22:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:22:29,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:29,791 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-28 03:22:29,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:22:29,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:29,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:29,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-28 03:22:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:22:29,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979895709] [2024-11-28 03:22:29,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:22:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:30,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:22:30,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:22:30,107 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:22:30,107 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:22:30,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 03:22:30,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:22:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:22:30,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:22:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:22:32,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:22:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979895709] [2024-11-28 03:22:32,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979895709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:22:32,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:22:32,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-28 03:22:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051291699] [2024-11-28 03:22:32,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:22:32,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:22:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:22:32,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:22:32,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:22:32,572 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:33,633 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-28 03:22:33,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:22:33,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 03:22:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:33,635 INFO L225 Difference]: With dead ends: 24 [2024-11-28 03:22:33,635 INFO L226 Difference]: Without dead ends: 22 [2024-11-28 03:22:33,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-28 03:22:33,636 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:33,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:22:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-28 03:22:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-28 03:22:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-28 03:22:33,645 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2024-11-28 03:22:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:33,645 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-28 03:22:33,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-28 03:22:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:22:33,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:33,647 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2024-11-28 03:22:33,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:22:33,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:33,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:33,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1003628899, now seen corresponding path program 3 times [2024-11-28 03:22:33,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:22:33,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943463751] [2024-11-28 03:22:33,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:22:33,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:33,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:33,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:22:33,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:22:34,018 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-28 03:22:34,018 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:22:34,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 03:22:34,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:22:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:22:34,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:22:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:22:41,889 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:22:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943463751] [2024-11-28 03:22:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943463751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:22:41,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:22:41,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-28 03:22:41,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341047052] [2024-11-28 03:22:41,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:22:41,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 03:22:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:22:41,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:22:41,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-28 03:22:41,891 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:22:47,695 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-28 03:22:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 03:22:47,696 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-28 03:22:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:22:47,696 INFO L225 Difference]: With dead ends: 42 [2024-11-28 03:22:47,697 INFO L226 Difference]: Without dead ends: 40 [2024-11-28 03:22:47,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2024-11-28 03:22:47,698 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:22:47,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 03:22:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-28 03:22:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-28 03:22:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-28 03:22:47,729 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 20 [2024-11-28 03:22:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:22:47,729 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-11-28 03:22:47,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-28 03:22:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 03:22:47,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:22:47,730 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2024-11-28 03:22:47,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:22:47,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:47,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:22:47,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1673576541, now seen corresponding path program 4 times [2024-11-28 03:22:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:22:47,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1960785974] [2024-11-28 03:22:47,939 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:22:47,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:47,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:47,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:22:47,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:22:48,272 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:22:48,273 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:22:48,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-28 03:22:48,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:22:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:22:49,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:23:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:23:17,120 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:23:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960785974] [2024-11-28 03:23:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960785974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:23:17,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:23:17,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2024-11-28 03:23:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878557881] [2024-11-28 03:23:17,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:23:17,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-28 03:23:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:23:17,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-28 03:23:17,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 03:23:17,124 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:23:43,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:23:57,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:24:02,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:24:09,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:24:11,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:24:15,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:24:19,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-28 03:24:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:21,214 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-11-28 03:24:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-28 03:24:21,215 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-28 03:24:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:21,216 INFO L225 Difference]: With dead ends: 80 [2024-11-28 03:24:21,216 INFO L226 Difference]: Without dead ends: 78 [2024-11-28 03:24:21,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=1167, Invalid=3525, Unknown=0, NotChecked=0, Total=4692 [2024-11-28 03:24:21,219 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:21,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 50 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 441 Invalid, 1 Unknown, 0 Unchecked, 19.4s Time] [2024-11-28 03:24:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-28 03:24:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-11-28 03:24:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-28 03:24:21,268 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 38 [2024-11-28 03:24:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:21,268 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-28 03:24:21,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-11-28 03:24:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 03:24:21,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:21,269 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2024-11-28 03:24:21,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:24:21,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:21,470 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:24:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2084907299, now seen corresponding path program 5 times [2024-11-28 03:24:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:21,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056403873] [2024-11-28 03:24:21,471 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:24:21,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:21,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:21,473 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:21,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:24:21,750 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2024-11-28 03:24:21,750 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 03:24:21,750 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:24:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:24:22,027 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-28 03:24:22,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:24:22,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:24:22,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:24:22,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:22,234 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1] [2024-11-28 03:24:22,331 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:24:22,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:24:22 BoogieIcfgContainer [2024-11-28 03:24:22,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:24:22,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:24:22,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:24:22,339 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:24:22,341 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:26" (3/4) ... [2024-11-28 03:24:22,341 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:24:22,499 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 48. [2024-11-28 03:24:22,603 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:24:22,603 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:24:22,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:24:22,605 INFO L158 Benchmark]: Toolchain (without parser) took 116628.82ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 60.2MB in the beginning and 221.3MB in the end (delta: -161.1MB). Peak memory consumption was 245.1MB. Max. memory is 16.1GB. [2024-11-28 03:24:22,605 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:22,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.99ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 46.8MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:24:22,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.98ms. Allocated memory is still 83.9MB. Free memory was 46.8MB in the beginning and 45.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:22,605 INFO L158 Benchmark]: Boogie Preprocessor took 42.19ms. Allocated memory is still 83.9MB. Free memory was 45.1MB in the beginning and 43.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:22,606 INFO L158 Benchmark]: RCFGBuilder took 440.91ms. Allocated memory is still 83.9MB. Free memory was 43.6MB in the beginning and 29.7MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:24:22,606 INFO L158 Benchmark]: TraceAbstraction took 115388.42ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 29.1MB in the beginning and 238.1MB in the end (delta: -209.0MB). Peak memory consumption was 186.4MB. Max. memory is 16.1GB. [2024-11-28 03:24:22,606 INFO L158 Benchmark]: Witness Printer took 265.63ms. Allocated memory is still 486.5MB. Free memory was 238.1MB in the beginning and 221.3MB in the end (delta: 16.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:24:22,608 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.31ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.99ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 46.8MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.98ms. Allocated memory is still 83.9MB. Free memory was 46.8MB in the beginning and 45.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.19ms. Allocated memory is still 83.9MB. Free memory was 45.1MB in the beginning and 43.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 440.91ms. Allocated memory is still 83.9MB. Free memory was 43.6MB in the beginning and 29.7MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 115388.42ms. Allocated memory was 83.9MB in the beginning and 486.5MB in the end (delta: 402.7MB). Free memory was 29.1MB in the beginning and 238.1MB in the end (delta: -209.0MB). Peak memory consumption was 186.4MB. Max. memory is 16.1GB. * Witness Printer took 265.63ms. Allocated memory is still 486.5MB. Free memory was 238.1MB in the beginning and 221.3MB in the end (delta: 16.8MB). Peak memory consumption was 25.2MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND FALSE !(!(cond)) [L72] RET __VERIFIER_assert(!(bad_16_arg_0)) [L74] SORT_1 var_28_arg_0 = state_18; [L75] SORT_1 var_28_arg_1 = state_20; [L76] SORT_1 var_28 = var_28_arg_0 == var_28_arg_1; [L77] SORT_4 var_24_arg_0 = state_6; [L78] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L79] SORT_23 var_24 = var_24_arg_0; [L80] SORT_23 var_26_arg_0 = var_24; [L81] SORT_23 var_26_arg_1 = var_25; [L82] SORT_23 var_26 = var_26_arg_0 + var_26_arg_1; [L83] SORT_23 var_27_arg_0 = var_26; [L84] SORT_4 var_27 = var_27_arg_0 >> 0; [L85] SORT_1 var_29_arg_0 = var_28; [L86] SORT_4 var_29_arg_1 = state_6; [L87] SORT_4 var_29_arg_2 = var_27; [L88] SORT_4 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L89] var_29 = var_29 & mask_SORT_4 [L90] SORT_4 next_30_arg_1 = var_29; [L91] SORT_4 var_31_arg_0 = state_8; [L92] var_31_arg_0 = var_31_arg_0 & mask_SORT_4 [L93] SORT_23 var_31 = var_31_arg_0; [L94] SORT_23 var_32_arg_0 = var_31; [L95] SORT_23 var_32_arg_1 = var_25; [L96] SORT_23 var_32 = var_32_arg_0 + var_32_arg_1; [L97] SORT_23 var_33_arg_0 = var_32; [L98] SORT_4 var_33 = var_33_arg_0 >> 0; [L99] SORT_1 var_34_arg_0 = var_28; [L100] SORT_4 var_34_arg_1 = var_33; [L101] SORT_4 var_34_arg_2 = state_8; [L102] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; [L103] var_34 = var_34 & mask_SORT_4 [L104] SORT_4 next_35_arg_1 = var_34; [L105] SORT_1 var_36_arg_0 = state_20; [L106] SORT_1 var_36 = ~var_36_arg_0; [L107] var_36 = var_36 & mask_SORT_1 [L108] SORT_1 next_37_arg_1 = var_36; [L109] SORT_1 next_38_arg_1 = state_18; [L111] state_6 = next_30_arg_1 [L112] state_8 = next_35_arg_1 [L113] state_18 = next_37_arg_1 [L114] state_20 = next_38_arg_1 [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 115.2s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 71.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 20.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 20.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 675 IncrementalHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 19 mSDtfsCounter, 675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 66.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 41.0s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 150 ConstructedInterpolants, 61 QuantifiedInterpolants, 89502 SizeOfPredicates, 22 NumberOfNonLiveVariables, 519 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 0/472 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-28 03:24:22,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22f4427b-abac-4789-9eb6-a77796efad46/bin/uautomizer-verify-aQ6SnzHsRB/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