./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/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_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/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 32bit --witnessprinter.graph.data.programhash 4fa401c700a21fa1f98a1481c8e8ba1555a45c0429555dc041a1c04ce1059991 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:59:46,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:59:46,848 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:59:46,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:59:46,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:59:46,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:59:46,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:59:46,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:59:46,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:59:46,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:59:46,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:59:46,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:59:46,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:59:46,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:59:46,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:59:46,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:59:46,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:59:46,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:59:46,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:59:46,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:59:46,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:59:46,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:59:46,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:59:46,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:59:46,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:59:46,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:59:46,880 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:59:46,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:59:46,881 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:59:46,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:59:46,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:59:46,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:59:46,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:59:46,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:59:46,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:59:46,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:59:46,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:59:46,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:59:46,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:59:46,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:59:46,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:59:46,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:59:46,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:59:46,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:59:46,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:59:46,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:59:46,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:59:46,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:59:46,884 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_9417a47b-b610-4d74-8585-18608dd0760c/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fa401c700a21fa1f98a1481c8e8ba1555a45c0429555dc041a1c04ce1059991 [2024-11-28 03:59:47,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:59:47,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:59:47,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:59:47,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:59:47,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:59:47,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c [2024-11-28 03:59:50,540 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/data/d8f8658a6/2cbb31e411f142d3aefcff1dad05923a/FLAG8dedd9ab3 [2024-11-28 03:59:50,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:59:50,921 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c [2024-11-28 03:59:50,932 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/data/d8f8658a6/2cbb31e411f142d3aefcff1dad05923a/FLAG8dedd9ab3 [2024-11-28 03:59:50,959 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/data/d8f8658a6/2cbb31e411f142d3aefcff1dad05923a [2024-11-28 03:59:50,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:59:50,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:59:50,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:59:50,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:59:50,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:59:50,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:59:50" (1/1) ... [2024-11-28 03:59:50,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f56224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:50, skipping insertion in model container [2024-11-28 03:59:50,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:59:50" (1/1) ... [2024-11-28 03:59:51,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:59:51,225 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_9417a47b-b610-4d74-8585-18608dd0760c/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c[421,434] [2024-11-28 03:59:51,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:59:51,270 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:59:51,287 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_9417a47b-b610-4d74-8585-18608dd0760c/sv-benchmarks/c/array-multidimensional/init-non-constant-2-n-u.c[421,434] [2024-11-28 03:59:51,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:59:51,323 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:59:51,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51 WrapperNode [2024-11-28 03:59:51,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:59:51,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:59:51,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:59:51,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:59:51,335 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:59:51" (1/1) ... [2024-11-28 03:59:51,343 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:59:51" (1/1) ... [2024-11-28 03:59:51,367 INFO L138 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-28 03:59:51,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:59:51,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:59:51,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:59:51,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:59:51,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,405 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-28 03:59:51,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:59:51,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:59:51,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:59:51,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:59:51,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (1/1) ... [2024-11-28 03:59:51,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:59:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:51,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/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:59:51,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/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:59:51,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:59:51,526 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:59:51,526 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:59:51,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:59:51,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:59:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:59:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:59:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:59:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:59:51,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:59:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:59:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:59:51,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:59:51,637 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:59:51,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:59:51,903 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-28 03:59:51,905 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:59:51,922 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:59:51,924 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-28 03:59:51,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:59:51 BoogieIcfgContainer [2024-11-28 03:59:51,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:59:51,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:59:51,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:59:51,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:59:51,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:59:50" (1/3) ... [2024-11-28 03:59:51,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a80aee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:59:51, skipping insertion in model container [2024-11-28 03:59:51,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:59:51" (2/3) ... [2024-11-28 03:59:51,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a80aee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:59:51, skipping insertion in model container [2024-11-28 03:59:51,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:59:51" (3/3) ... [2024-11-28 03:59:51,941 INFO L128 eAbstractionObserver]: Analyzing ICFG init-non-constant-2-n-u.c [2024-11-28 03:59:51,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:59:51,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-non-constant-2-n-u.c that has 2 procedures, 27 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2024-11-28 03:59:52,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:59:52,071 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;@1167625c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:59:52,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:59:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:59:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-28 03:59:52,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:52,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:59:52,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:59:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash 784185733, now seen corresponding path program 1 times [2024-11-28 03:59:52,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:52,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918850251] [2024-11-28 03:59:52,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:59:52,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:52,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918850251] [2024-11-28 03:59:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918850251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:59:52,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:59:52,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:59:52,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913673425] [2024-11-28 03:59:52,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:59:52,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:59:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:52,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:59:52,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:59:52,612 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:59:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:52,721 INFO L93 Difference]: Finished difference Result 67 states and 99 transitions. [2024-11-28 03:59:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:59:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-28 03:59:52,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:52,732 INFO L225 Difference]: With dead ends: 67 [2024-11-28 03:59:52,733 INFO L226 Difference]: Without dead ends: 37 [2024-11-28 03:59:52,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:59:52,743 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:52,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 62 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:59:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-28 03:59:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2024-11-28 03:59:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:59:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-28 03:59:52,807 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 20 [2024-11-28 03:59:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:52,808 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-28 03:59:52,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:59:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-28 03:59:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 03:59:52,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:52,814 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:59:52,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:59:52,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:59:52,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -78096625, now seen corresponding path program 1 times [2024-11-28 03:59:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:52,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565869343] [2024-11-28 03:59:52,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:59:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565869343] [2024-11-28 03:59:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565869343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:59:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:59:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:59:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570255662] [2024-11-28 03:59:53,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:59:53,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:59:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:53,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:59:53,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:59:53,167 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:59:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:53,252 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-11-28 03:59:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:59:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-28 03:59:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:53,254 INFO L225 Difference]: With dead ends: 56 [2024-11-28 03:59:53,254 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 03:59:53,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:59:53,255 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:53,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:59:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 03:59:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2024-11-28 03:59:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:59:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-28 03:59:53,262 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 24 [2024-11-28 03:59:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:53,262 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-28 03:59:53,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:59:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-11-28 03:59:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:59:53,264 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:53,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:59:53,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:59:53,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:59:53,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1376260653, now seen corresponding path program 1 times [2024-11-28 03:59:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:53,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972149301] [2024-11-28 03:59:53,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:53,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:59:53,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481802405] [2024-11-28 03:59:53,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:53,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:53,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:53,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:59:53,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:59:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:53,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 03:59:53,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:53,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:59:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:59:54,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:59:54,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-11-28 03:59:54,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-28 03:59:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:59:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972149301] [2024-11-28 03:59:55,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 03:59:55,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481802405] [2024-11-28 03:59:55,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481802405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:59:55,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:59:55,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2024-11-28 03:59:55,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87787171] [2024-11-28 03:59:55,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:59:55,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-28 03:59:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:55,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-28 03:59:55,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:59:55,728 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 03:59:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:56,873 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2024-11-28 03:59:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 03:59:56,874 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2024-11-28 03:59:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:56,875 INFO L225 Difference]: With dead ends: 103 [2024-11-28 03:59:56,876 INFO L226 Difference]: Without dead ends: 83 [2024-11-28 03:59:56,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=450, Invalid=1190, Unknown=0, NotChecked=0, Total=1640 [2024-11-28 03:59:56,878 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 240 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:56,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 142 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 03:59:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-28 03:59:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 42. [2024-11-28 03:59:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:59:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-28 03:59:56,889 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 26 [2024-11-28 03:59:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:56,889 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-28 03:59:56,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 03:59:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-28 03:59:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 03:59:56,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:56,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:59:56,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:59:57,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:57,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:59:57,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1629922334, now seen corresponding path program 1 times [2024-11-28 03:59:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:57,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115633075] [2024-11-28 03:59:57,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:57,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:59:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454823982] [2024-11-28 03:59:57,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:57,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:57,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:57,126 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:59:57,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:59:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:57,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 03:59:57,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:57,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:59:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:59:57,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:59:57,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2024-11-28 03:59:57,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2024-11-28 03:59:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:59:58,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:58,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115633075] [2024-11-28 03:59:58,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 03:59:58,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454823982] [2024-11-28 03:59:58,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454823982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:59:58,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:59:58,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-28 03:59:58,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529242108] [2024-11-28 03:59:58,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:59:58,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 03:59:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:58,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 03:59:58,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-28 03:59:58,078 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:59:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:59:58,508 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-28 03:59:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:59:58,509 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-28 03:59:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:59:58,510 INFO L225 Difference]: With dead ends: 91 [2024-11-28 03:59:58,510 INFO L226 Difference]: Without dead ends: 89 [2024-11-28 03:59:58,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:59:58,512 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 98 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:59:58,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 160 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:59:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-28 03:59:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 46. [2024-11-28 03:59:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:59:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-28 03:59:58,526 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 32 [2024-11-28 03:59:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:59:58,526 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-28 03:59:58,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:59:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-11-28 03:59:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 03:59:58,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:59:58,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:59:58,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:59:58,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:58,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:59:58,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1004613537, now seen corresponding path program 2 times [2024-11-28 03:59:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735929987] [2024-11-28 03:59:58,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:59:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:58,785 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:59:58,785 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 03:59:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590712096] [2024-11-28 03:59:58,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:59:58,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:58,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:58,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:59:58,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:59:58,884 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:59:58,885 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:59:58,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 03:59:58,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:59,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:59:59,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:59:59,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2024-11-28 03:59:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:59:59,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:21,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-28 04:00:21,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 172 [2024-11-28 04:00:22,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:22,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735929987] [2024-11-28 04:00:22,197 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:00:22,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590712096] [2024-11-28 04:00:22,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590712096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:22,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:00:22,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-28 04:00:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805957640] [2024-11-28 04:00:22,198 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:22,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:00:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:22,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:00:22,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=235, Unknown=5, NotChecked=0, Total=306 [2024-11-28 04:00:22,200 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:22,443 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-28 04:00:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:00:22,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-28 04:00:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:22,445 INFO L225 Difference]: With dead ends: 61 [2024-11-28 04:00:22,445 INFO L226 Difference]: Without dead ends: 59 [2024-11-28 04:00:22,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=80, Invalid=257, Unknown=5, NotChecked=0, Total=342 [2024-11-28 04:00:22,446 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:22,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 100 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:00:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-28 04:00:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2024-11-28 04:00:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-28 04:00:22,475 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 32 [2024-11-28 04:00:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:22,477 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-28 04:00:22,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-28 04:00:22,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 04:00:22,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:22,478 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:22,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:00:22,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:22,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1875822885, now seen corresponding path program 2 times [2024-11-28 04:00:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454478924] [2024-11-28 04:00:22,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:00:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:22,730 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:00:22,734 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454478924] [2024-11-28 04:00:23,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454478924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229386798] [2024-11-28 04:00:23,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:00:23,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:23,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:23,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:00:23,166 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:00:23,166 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:23,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:00:23,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:23,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:23,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229386798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:23,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:23,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-28 04:00:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403535222] [2024-11-28 04:00:23,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:23,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:00:23,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:23,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:00:23,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:00:23,422 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:23,622 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2024-11-28 04:00:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:00:23,623 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-28 04:00:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:23,625 INFO L225 Difference]: With dead ends: 140 [2024-11-28 04:00:23,628 INFO L226 Difference]: Without dead ends: 118 [2024-11-28 04:00:23,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:00:23,630 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:23,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 162 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:00:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-28 04:00:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2024-11-28 04:00:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2024-11-28 04:00:23,670 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 36 [2024-11-28 04:00:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:23,670 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2024-11-28 04:00:23,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2024-11-28 04:00:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 04:00:23,673 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:23,674 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:23,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:00:23,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:23,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:23,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash 844894323, now seen corresponding path program 1 times [2024-11-28 04:00:23,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:23,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392384970] [2024-11-28 04:00:23,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:24,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:24,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392384970] [2024-11-28 04:00:24,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392384970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:24,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923540773] [2024-11-28 04:00:24,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:00:24,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:24,062 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:24,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:00:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:24,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:00:24,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:24,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923540773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:24,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:24,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-28 04:00:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721605212] [2024-11-28 04:00:24,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:24,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:00:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:24,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:00:24,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:00:24,339 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:24,527 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2024-11-28 04:00:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:00:24,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-28 04:00:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:24,531 INFO L225 Difference]: With dead ends: 161 [2024-11-28 04:00:24,531 INFO L226 Difference]: Without dead ends: 133 [2024-11-28 04:00:24,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:00:24,532 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:24,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:00:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-28 04:00:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2024-11-28 04:00:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 119 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2024-11-28 04:00:24,583 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 36 [2024-11-28 04:00:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:24,583 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2024-11-28 04:00:24,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2024-11-28 04:00:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-28 04:00:24,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:24,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:24,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:24,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-28 04:00:24,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:24,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash 193059624, now seen corresponding path program 3 times [2024-11-28 04:00:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:24,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403184850] [2024-11-28 04:00:24,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:00:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:24,829 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 04:00:24,830 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 04:00:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403184850] [2024-11-28 04:00:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403184850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131764990] [2024-11-28 04:00:24,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:00:24,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:24,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:24,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:24,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:00:25,073 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 04:00:25,073 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:25,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:00:25,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 04:00:25,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 04:00:25,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131764990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:25,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:25,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-28 04:00:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649281618] [2024-11-28 04:00:25,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:25,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:00:25,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:25,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:00:25,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:00:25,234 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:25,373 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2024-11-28 04:00:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:00:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-28 04:00:25,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:25,377 INFO L225 Difference]: With dead ends: 157 [2024-11-28 04:00:25,377 INFO L226 Difference]: Without dead ends: 129 [2024-11-28 04:00:25,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:00:25,378 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:25,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 168 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:00:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-28 04:00:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-11-28 04:00:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.1512605042016806) internal successors, (137), 119 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2024-11-28 04:00:25,415 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 36 [2024-11-28 04:00:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:25,415 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2024-11-28 04:00:25,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2024-11-28 04:00:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-28 04:00:25,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:25,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:25,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:00:25,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:25,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:25,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1911662103, now seen corresponding path program 4 times [2024-11-28 04:00:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993539308] [2024-11-28 04:00:25,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:00:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:25,667 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:00:25,668 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:00:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98667509] [2024-11-28 04:00:25,669 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:00:25,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:25,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:25,672 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:25,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:00:25,770 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:00:25,771 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:25,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 04:00:25,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:25,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:00:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:26,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:26,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2024-11-28 04:00:26,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2024-11-28 04:00:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:26,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:26,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993539308] [2024-11-28 04:00:26,884 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:00:26,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98667509] [2024-11-28 04:00:26,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98667509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:26,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:26,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2024-11-28 04:00:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471453290] [2024-11-28 04:00:26,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:26,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:00:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:26,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:00:26,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:00:26,886 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:27,544 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2024-11-28 04:00:27,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:00:27,545 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-28 04:00:27,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:27,547 INFO L225 Difference]: With dead ends: 202 [2024-11-28 04:00:27,547 INFO L226 Difference]: Without dead ends: 200 [2024-11-28 04:00:27,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-28 04:00:27,548 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 102 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:27,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 200 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:00:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-28 04:00:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 127. [2024-11-28 04:00:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 123 states have (on average 1.1544715447154472) internal successors, (142), 123 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2024-11-28 04:00:27,591 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 38 [2024-11-28 04:00:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:27,593 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2024-11-28 04:00:27,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2024-11-28 04:00:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 04:00:27,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:27,599 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:27,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:00:27,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:27,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:27,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1354939600, now seen corresponding path program 5 times [2024-11-28 04:00:27,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:27,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474571812] [2024-11-28 04:00:27,803 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:00:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:27,862 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-28 04:00:27,862 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:00:27,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976401715] [2024-11-28 04:00:27,863 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:00:27,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:27,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:27,869 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:27,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:00:28,125 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-28 04:00:28,125 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:28,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-28 04:00:28,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:28,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:00:28,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:00:28,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-28 04:00:28,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:00:28,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-28 04:00:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:28,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:33,869 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_41| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_41| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~j~0#1_118| Int)) (or (forall ((v_ArrVal_126 Int) (v_ArrVal_124 Int) (|v_ULTIMATE.start_main_~j~0#1_117| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_117| (+ |v_ULTIMATE.start_main_~j~0#1_118| 1)) (= (mod (+ |c_ULTIMATE.start_main_~C~0#1| 1) 4294967296) (mod (select (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_41| (* |c_ULTIMATE.start_main_~n~0#1| 4)))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_118| 4)) v_ArrVal_124) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_117| 4) .cse0) v_ArrVal_126)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 4)) 4294967296)))) (< |v_ULTIMATE.start_main_~j~0#1_118| 0))))) is different from false [2024-11-28 04:00:33,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-28 04:00:33,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1766 treesize of output 1734 [2024-11-28 04:00:36,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:36,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474571812] [2024-11-28 04:00:36,440 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:00:36,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976401715] [2024-11-28 04:00:36,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976401715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:36,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:00:36,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-28 04:00:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678903875] [2024-11-28 04:00:36,440 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:36,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:00:36,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:36,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:00:36,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=412, Unknown=1, NotChecked=42, Total=552 [2024-11-28 04:00:36,442 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:36,793 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2024-11-28 04:00:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:00:36,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-28 04:00:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:36,795 INFO L225 Difference]: With dead ends: 153 [2024-11-28 04:00:36,795 INFO L226 Difference]: Without dead ends: 151 [2024-11-28 04:00:36,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=110, Invalid=445, Unknown=1, NotChecked=44, Total=600 [2024-11-28 04:00:36,796 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:36,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 121 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:00:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-28 04:00:36,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 123. [2024-11-28 04:00:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.1512605042016806) internal successors, (137), 119 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2024-11-28 04:00:36,830 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 40 [2024-11-28 04:00:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:36,830 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2024-11-28 04:00:36,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2024-11-28 04:00:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 04:00:36,831 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:36,831 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:36,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:37,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:37,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:37,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1228121606, now seen corresponding path program 2 times [2024-11-28 04:00:37,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:37,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601639763] [2024-11-28 04:00:37,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:00:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:37,059 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:00:37,059 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 04:00:37,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601639763] [2024-11-28 04:00:37,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601639763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:37,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111283177] [2024-11-28 04:00:37,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:00:37,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:37,244 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:37,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 04:00:37,318 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:00:37,318 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:37,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:00:37,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 04:00:37,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 04:00:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111283177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:37,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-28 04:00:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138545779] [2024-11-28 04:00:37,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:37,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:00:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:37,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:00:37,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:00:37,505 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:00:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:37,628 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2024-11-28 04:00:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:00:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-28 04:00:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:37,630 INFO L225 Difference]: With dead ends: 251 [2024-11-28 04:00:37,630 INFO L226 Difference]: Without dead ends: 205 [2024-11-28 04:00:37,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:00:37,632 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:37,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 94 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:00:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-28 04:00:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 129. [2024-11-28 04:00:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 125 states have (on average 1.144) internal successors, (143), 125 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2024-11-28 04:00:37,677 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 40 [2024-11-28 04:00:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:37,677 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2024-11-28 04:00:37,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:00:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2024-11-28 04:00:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-28 04:00:37,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:37,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:37,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:37,879 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:37,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1053864573, now seen corresponding path program 3 times [2024-11-28 04:00:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67442180] [2024-11-28 04:00:37,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:00:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:37,909 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:00:37,909 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:00:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853996874] [2024-11-28 04:00:37,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:00:37,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:37,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:37,915 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:37,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 04:00:38,009 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-28 04:00:38,009 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:38,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 04:00:38,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:38,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:00:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 04:00:38,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:38,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2024-11-28 04:00:38,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2024-11-28 04:00:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 04:00:38,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:38,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67442180] [2024-11-28 04:00:38,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:00:38,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853996874] [2024-11-28 04:00:38,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853996874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:38,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:38,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-28 04:00:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037458957] [2024-11-28 04:00:38,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:38,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:00:38,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:38,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:00:38,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:00:38,774 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:00:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:39,213 INFO L93 Difference]: Finished difference Result 336 states and 382 transitions. [2024-11-28 04:00:39,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:00:39,214 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-28 04:00:39,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:39,216 INFO L225 Difference]: With dead ends: 336 [2024-11-28 04:00:39,217 INFO L226 Difference]: Without dead ends: 334 [2024-11-28 04:00:39,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-11-28 04:00:39,218 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 115 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:39,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 247 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:00:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-28 04:00:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 202. [2024-11-28 04:00:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.1313131313131313) internal successors, (224), 198 states have internal predecessors, (224), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 228 transitions. [2024-11-28 04:00:39,278 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 228 transitions. Word has length 40 [2024-11-28 04:00:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:39,278 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 228 transitions. [2024-11-28 04:00:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:00:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 228 transitions. [2024-11-28 04:00:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 04:00:39,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:39,279 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:39,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 04:00:39,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:39,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:39,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash -754933392, now seen corresponding path program 6 times [2024-11-28 04:00:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835607681] [2024-11-28 04:00:39,480 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:00:39,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:39,513 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 04:00:39,514 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:39,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:39,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835607681] [2024-11-28 04:00:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835607681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022093715] [2024-11-28 04:00:39,710 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:00:39,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:39,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:39,712 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:39,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 04:00:39,796 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 04:00:39,797 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:39,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 04:00:39,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:39,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:40,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022093715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:40,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:40,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-11-28 04:00:40,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850646833] [2024-11-28 04:00:40,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:40,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 04:00:40,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:40,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 04:00:40,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-28 04:00:40,059 INFO L87 Difference]: Start difference. First operand 202 states and 228 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:40,346 INFO L93 Difference]: Finished difference Result 434 states and 494 transitions. [2024-11-28 04:00:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:00:40,347 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-28 04:00:40,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:40,349 INFO L225 Difference]: With dead ends: 434 [2024-11-28 04:00:40,349 INFO L226 Difference]: Without dead ends: 314 [2024-11-28 04:00:40,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-11-28 04:00:40,351 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 73 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:40,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 213 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:00:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-28 04:00:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 286. [2024-11-28 04:00:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 282 states have (on average 1.1524822695035462) internal successors, (325), 282 states have internal predecessors, (325), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2024-11-28 04:00:40,405 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 42 [2024-11-28 04:00:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:40,406 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2024-11-28 04:00:40,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2024-11-28 04:00:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-28 04:00:40,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:40,407 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:40,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:40,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 04:00:40,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash 127504180, now seen corresponding path program 7 times [2024-11-28 04:00:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:40,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600741156] [2024-11-28 04:00:40,609 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 04:00:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 04:00:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1155797201] [2024-11-28 04:00:40,673 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 04:00:40,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:40,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:40,679 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:40,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 04:00:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:00:40,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-28 04:00:40,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:40,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:00:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:41,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:41,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2024-11-28 04:00:41,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2024-11-28 04:00:41,984 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:41,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:41,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600741156] [2024-11-28 04:00:41,984 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:00:41,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155797201] [2024-11-28 04:00:41,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155797201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:41,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:41,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2024-11-28 04:00:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990138024] [2024-11-28 04:00:41,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:00:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:41,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:00:41,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-28 04:00:41,987 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:42,614 INFO L93 Difference]: Finished difference Result 337 states and 385 transitions. [2024-11-28 04:00:42,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 04:00:42,615 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-28 04:00:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:42,617 INFO L225 Difference]: With dead ends: 337 [2024-11-28 04:00:42,617 INFO L226 Difference]: Without dead ends: 335 [2024-11-28 04:00:42,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:00:42,618 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 85 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:42,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 253 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:00:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-28 04:00:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 290. [2024-11-28 04:00:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 286 states have (on average 1.1503496503496504) internal successors, (329), 286 states have internal predecessors, (329), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 333 transitions. [2024-11-28 04:00:42,677 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 333 transitions. Word has length 44 [2024-11-28 04:00:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:42,677 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 333 transitions. [2024-11-28 04:00:42,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 333 transitions. [2024-11-28 04:00:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-28 04:00:42,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:42,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:42,689 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-28 04:00:42,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-28 04:00:42,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:42,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash -981224501, now seen corresponding path program 4 times [2024-11-28 04:00:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414431038] [2024-11-28 04:00:42,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:00:42,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:42,906 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:00:42,906 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:00:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498994369] [2024-11-28 04:00:42,908 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:00:42,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:42,910 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:42,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 04:00:43,014 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:00:43,014 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:43,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 04:00:43,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:43,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:00:43,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 04:00:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 04:00:43,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:44,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2024-11-28 04:00:44,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 155 [2024-11-28 04:00:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 04:00:45,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:45,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414431038] [2024-11-28 04:00:45,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:00:45,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498994369] [2024-11-28 04:00:45,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498994369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:45,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:45,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-11-28 04:00:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608448352] [2024-11-28 04:00:45,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:45,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 04:00:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:45,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 04:00:45,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-28 04:00:45,242 INFO L87 Difference]: Start difference. First operand 290 states and 333 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:00:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:46,876 INFO L93 Difference]: Finished difference Result 665 states and 772 transitions. [2024-11-28 04:00:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 04:00:46,877 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-28 04:00:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:46,879 INFO L225 Difference]: With dead ends: 665 [2024-11-28 04:00:46,880 INFO L226 Difference]: Without dead ends: 663 [2024-11-28 04:00:46,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2024-11-28 04:00:46,881 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 256 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:46,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 409 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 04:00:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-28 04:00:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 328. [2024-11-28 04:00:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 324 states have (on average 1.1512345679012346) internal successors, (373), 324 states have internal predecessors, (373), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 377 transitions. [2024-11-28 04:00:46,969 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 377 transitions. Word has length 46 [2024-11-28 04:00:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:46,970 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 377 transitions. [2024-11-28 04:00:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:00:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 377 transitions. [2024-11-28 04:00:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:00:46,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:46,971 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:46,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:47,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-28 04:00:47,175 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:47,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2114599227, now seen corresponding path program 8 times [2024-11-28 04:00:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243488778] [2024-11-28 04:00:47,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:00:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:47,195 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:00:47,195 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:47,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243488778] [2024-11-28 04:00:47,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243488778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235627701] [2024-11-28 04:00:47,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:00:47,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:47,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:47,430 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:47,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 04:00:47,512 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:00:47,512 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:47,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 04:00:47,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:47,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:47,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235627701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:47,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:47,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-28 04:00:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033899983] [2024-11-28 04:00:47,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:47,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 04:00:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:47,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 04:00:47,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2024-11-28 04:00:47,822 INFO L87 Difference]: Start difference. First operand 328 states and 377 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:48,122 INFO L93 Difference]: Finished difference Result 658 states and 759 transitions. [2024-11-28 04:00:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:00:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-28 04:00:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:48,125 INFO L225 Difference]: With dead ends: 658 [2024-11-28 04:00:48,125 INFO L226 Difference]: Without dead ends: 462 [2024-11-28 04:00:48,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2024-11-28 04:00:48,127 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 103 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:48,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 198 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:00:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-28 04:00:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 430. [2024-11-28 04:00:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 426 states have (on average 1.1713615023474178) internal successors, (499), 426 states have internal predecessors, (499), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 503 transitions. [2024-11-28 04:00:48,257 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 503 transitions. Word has length 48 [2024-11-28 04:00:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:48,257 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 503 transitions. [2024-11-28 04:00:48,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 503 transitions. [2024-11-28 04:00:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:00:48,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:48,259 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:48,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:48,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 04:00:48,460 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1774604095, now seen corresponding path program 9 times [2024-11-28 04:00:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:48,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048966773] [2024-11-28 04:00:48,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:00:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:48,533 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-28 04:00:48,533 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:00:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489896267] [2024-11-28 04:00:48,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:00:48,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:48,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:48,539 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:48,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-28 04:00:48,690 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 04:00:48,690 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:48,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-28 04:00:48,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:48,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-28 04:00:48,965 INFO L349 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2024-11-28 04:00:48,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2024-11-28 04:00:49,063 INFO L349 Elim1Store]: treesize reduction 31, result has 39.2 percent of original size [2024-11-28 04:00:49,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 36 [2024-11-28 04:00:49,180 INFO L349 Elim1Store]: treesize reduction 31, result has 39.2 percent of original size [2024-11-28 04:00:49,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2024-11-28 04:00:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 49 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:00:49,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:51,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2024-11-28 04:00:51,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1361 treesize of output 1345 [2024-11-28 04:00:53,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:53,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048966773] [2024-11-28 04:00:53,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:00:53,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489896267] [2024-11-28 04:00:53,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489896267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:53,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:00:53,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2024-11-28 04:00:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672190652] [2024-11-28 04:00:53,953 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:53,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 04:00:53,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:53,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 04:00:53,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 04:00:53,955 INFO L87 Difference]: Start difference. First operand 430 states and 503 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:55,393 INFO L93 Difference]: Finished difference Result 521 states and 598 transitions. [2024-11-28 04:00:55,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 04:00:55,393 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-28 04:00:55,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:55,396 INFO L225 Difference]: With dead ends: 521 [2024-11-28 04:00:55,396 INFO L226 Difference]: Without dead ends: 519 [2024-11-28 04:00:55,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=438, Invalid=1724, Unknown=0, NotChecked=0, Total=2162 [2024-11-28 04:00:55,398 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 125 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:55,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 167 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:00:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-28 04:00:55,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 430. [2024-11-28 04:00:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 426 states have (on average 1.1690140845070423) internal successors, (498), 426 states have internal predecessors, (498), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 502 transitions. [2024-11-28 04:00:55,531 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 502 transitions. Word has length 48 [2024-11-28 04:00:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:55,531 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 502 transitions. [2024-11-28 04:00:55,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 502 transitions. [2024-11-28 04:00:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-28 04:00:55,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:55,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:55,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-28 04:00:55,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-28 04:00:55,740 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:55,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 233675097, now seen corresponding path program 5 times [2024-11-28 04:00:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:55,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652238990] [2024-11-28 04:00:55,741 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:00:55,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:55,776 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-28 04:00:55,776 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:00:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652238990] [2024-11-28 04:00:55,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652238990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:00:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527314508] [2024-11-28 04:00:55,889 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:00:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:55,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:55,892 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:55,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-28 04:00:56,204 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-28 04:00:56,204 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:56,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 04:00:56,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:00:56,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:00:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527314508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:56,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:56,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-28 04:00:56,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466171607] [2024-11-28 04:00:56,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:56,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:00:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:56,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:00:56,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:00:56,369 INFO L87 Difference]: Start difference. First operand 430 states and 502 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:56,650 INFO L93 Difference]: Finished difference Result 833 states and 999 transitions. [2024-11-28 04:00:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:00:56,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-28 04:00:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:56,653 INFO L225 Difference]: With dead ends: 833 [2024-11-28 04:00:56,654 INFO L226 Difference]: Without dead ends: 719 [2024-11-28 04:00:56,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:00:56,655 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:56,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 122 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:00:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-28 04:00:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 457. [2024-11-28 04:00:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.161147902869757) internal successors, (526), 453 states have internal predecessors, (526), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 530 transitions. [2024-11-28 04:00:56,786 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 530 transitions. Word has length 48 [2024-11-28 04:00:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:56,786 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 530 transitions. [2024-11-28 04:00:56,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 530 transitions. [2024-11-28 04:00:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-28 04:00:56,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:56,787 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:56,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-28 04:00:56,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 04:00:56,987 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:56,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2050833409, now seen corresponding path program 10 times [2024-11-28 04:00:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:56,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497848807] [2024-11-28 04:00:56,988 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:00:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:57,035 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:00:57,035 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:00:57,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321689781] [2024-11-28 04:00:57,036 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:00:57,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:57,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:57,044 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:57,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-28 04:00:57,141 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:00:57,141 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:57,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-28 04:00:57,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:57,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:00:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:57,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:00:57,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2024-11-28 04:00:57,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2024-11-28 04:00:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:00:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:00:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497848807] [2024-11-28 04:00:58,082 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:00:58,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321689781] [2024-11-28 04:00:58,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321689781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:58,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:00:58,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2024-11-28 04:00:58,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789367806] [2024-11-28 04:00:58,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:58,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 04:00:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:58,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 04:00:58,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-28 04:00:58,084 INFO L87 Difference]: Start difference. First operand 457 states and 530 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:00:58,873 INFO L93 Difference]: Finished difference Result 532 states and 616 transitions. [2024-11-28 04:00:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:00:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-11-28 04:00:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:00:58,876 INFO L225 Difference]: With dead ends: 532 [2024-11-28 04:00:58,876 INFO L226 Difference]: Without dead ends: 530 [2024-11-28 04:00:58,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-11-28 04:00:58,877 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 98 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:00:58,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 323 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:00:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-28 04:00:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 461. [2024-11-28 04:00:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 457 states have (on average 1.1597374179431073) internal successors, (530), 457 states have internal predecessors, (530), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:00:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 534 transitions. [2024-11-28 04:00:59,019 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 534 transitions. Word has length 50 [2024-11-28 04:00:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:00:59,019 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 534 transitions. [2024-11-28 04:00:59,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:00:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 534 transitions. [2024-11-28 04:00:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-28 04:00:59,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:00:59,021 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:00:59,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-28 04:00:59,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:59,222 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:00:59,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:00:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash -469914809, now seen corresponding path program 11 times [2024-11-28 04:00:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:00:59,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446885230] [2024-11-28 04:00:59,223 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:00:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:00:59,274 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-28 04:00:59,276 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:00:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [351416228] [2024-11-28 04:00:59,278 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 04:00:59,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:00:59,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:00:59,281 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:00:59,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-28 04:00:59,588 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-28 04:00:59,588 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:00:59,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-28 04:00:59,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:00:59,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:00:59,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-28 04:00:59,929 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-11-28 04:00:59,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 29 [2024-11-28 04:01:00,011 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-11-28 04:01:00,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 29 [2024-11-28 04:01:00,094 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-11-28 04:01:00,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 29 [2024-11-28 04:01:00,169 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-11-28 04:01:00,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 29 [2024-11-28 04:01:00,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:01:00,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 34 [2024-11-28 04:01:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 04:01:00,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:01:59,223 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_296| Int) (v_ArrVal_345 Int) (|v_ULTIMATE.start_main_~j~0#1_295| Int) (v_ArrVal_352 Int) (v_ArrVal_350 Int) (|v_ULTIMATE.start_main_~j~0#1_294| Int) (v_ArrVal_347 Int)) (or (= (mod (+ |c_ULTIMATE.start_main_~C~0#1| 2) 4294967296) (mod (select (let ((.cse0 (* (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_345) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_296| 4)) v_ArrVal_347) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_295| 4) .cse0) v_ArrVal_350) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_294| 4) .cse0) v_ArrVal_352)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) 4294967296)) (< |v_ULTIMATE.start_main_~j~0#1_294| (+ |v_ULTIMATE.start_main_~j~0#1_295| 1)) (< |v_ULTIMATE.start_main_~j~0#1_296| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_295| (+ |v_ULTIMATE.start_main_~j~0#1_296| 1)))) is different from false [2024-11-28 04:02:03,327 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_297| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_296| Int) (v_ArrVal_345 Int) (|v_ULTIMATE.start_main_~j~0#1_295| Int) (v_ArrVal_352 Int) (v_ArrVal_350 Int) (|v_ULTIMATE.start_main_~j~0#1_294| Int) (v_ArrVal_347 Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_294| (+ |v_ULTIMATE.start_main_~j~0#1_295| 1)) (< |v_ULTIMATE.start_main_~j~0#1_296| (+ |v_ULTIMATE.start_main_~j~0#1_297| 1)) (= (mod (select (let ((.cse0 (* (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_297| 4) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0) v_ArrVal_345) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_296| 4)) v_ArrVal_347) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_295| 4) .cse0) v_ArrVal_350) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_294| 4) .cse0) v_ArrVal_352)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) 4294967296) (mod (+ |c_ULTIMATE.start_main_~C~0#1| 2) 4294967296)) (< |v_ULTIMATE.start_main_~j~0#1_295| (+ |v_ULTIMATE.start_main_~j~0#1_296| 1)))) (< |v_ULTIMATE.start_main_~j~0#1_297| 0))) is different from false [2024-11-28 04:02:07,429 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_93| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_93| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~j~0#1_297| Int)) (or (forall ((|v_ULTIMATE.start_main_~j~0#1_296| Int) (v_ArrVal_345 Int) (|v_ULTIMATE.start_main_~j~0#1_295| Int) (v_ArrVal_352 Int) (v_ArrVal_350 Int) (|v_ULTIMATE.start_main_~j~0#1_294| Int) (v_ArrVal_347 Int)) (or (= (mod (select (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_93| (* |c_ULTIMATE.start_main_~n~0#1| 4)))) (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_297| 4) .cse0 |c_ULTIMATE.start_main_~#A~0#1.offset|) v_ArrVal_345) (+ .cse0 |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_296| 4)) v_ArrVal_347) (+ .cse0 |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_295| 4)) v_ArrVal_350) (+ .cse0 |c_ULTIMATE.start_main_~#A~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_294| 4)) v_ArrVal_352)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 8)) 4294967296) (mod (+ |c_ULTIMATE.start_main_~C~0#1| 2) 4294967296)) (< |v_ULTIMATE.start_main_~j~0#1_294| (+ |v_ULTIMATE.start_main_~j~0#1_295| 1)) (< |v_ULTIMATE.start_main_~j~0#1_296| (+ |v_ULTIMATE.start_main_~j~0#1_297| 1)) (< |v_ULTIMATE.start_main_~j~0#1_295| (+ |v_ULTIMATE.start_main_~j~0#1_296| 1)))) (< |v_ULTIMATE.start_main_~j~0#1_297| 0))))) is different from false [2024-11-28 04:02:12,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 203 [2024-11-28 04:02:12,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206693 treesize of output 206181 [2024-11-28 04:02:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446885230] [2024-11-28 04:02:29,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:02:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351416228] [2024-11-28 04:02:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351416228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:02:29,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:02:29,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2024-11-28 04:02:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928936052] [2024-11-28 04:02:29,140 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 04:02:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:29,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 04:02:29,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1186, Unknown=14, NotChecked=222, Total=1640 [2024-11-28 04:02:29,142 INFO L87 Difference]: Start difference. First operand 461 states and 534 transitions. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:02:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:02:30,033 INFO L93 Difference]: Finished difference Result 688 states and 787 transitions. [2024-11-28 04:02:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 04:02:30,034 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2024-11-28 04:02:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:02:30,037 INFO L225 Difference]: With dead ends: 688 [2024-11-28 04:02:30,037 INFO L226 Difference]: Without dead ends: 686 [2024-11-28 04:02:30,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 73.1s TimeCoverageRelationStatistics Valid=248, Invalid=1310, Unknown=14, NotChecked=234, Total=1806 [2024-11-28 04:02:30,038 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 77 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:02:30,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 207 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:02:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-28 04:02:30,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 501. [2024-11-28 04:02:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 497 states have (on average 1.1569416498993963) internal successors, (575), 497 states have internal predecessors, (575), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:02:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 579 transitions. [2024-11-28 04:02:30,201 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 579 transitions. Word has length 52 [2024-11-28 04:02:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:02:30,201 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 579 transitions. [2024-11-28 04:02:30,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:02:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 579 transitions. [2024-11-28 04:02:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-28 04:02:30,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:02:30,203 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:30,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-28 04:02:30,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:30,404 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:02:30,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:30,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1896138003, now seen corresponding path program 6 times [2024-11-28 04:02:30,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:30,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634952638] [2024-11-28 04:02:30,405 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:02:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:30,463 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 04:02:30,464 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:02:30,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799676462] [2024-11-28 04:02:30,466 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:02:30,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:30,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:30,469 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:30,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-28 04:02:30,571 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-28 04:02:30,571 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:30,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-28 04:02:30,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:30,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:02:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-28 04:02:31,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:31,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-28 04:02:31,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2024-11-28 04:02:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-28 04:02:32,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:32,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634952638] [2024-11-28 04:02:32,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:02:32,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799676462] [2024-11-28 04:02:32,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799676462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:02:32,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:02:32,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2024-11-28 04:02:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301513027] [2024-11-28 04:02:32,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:32,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 04:02:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:32,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 04:02:32,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-28 04:02:32,851 INFO L87 Difference]: Start difference. First operand 501 states and 579 transitions. Second operand has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:02:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:02:33,885 INFO L93 Difference]: Finished difference Result 652 states and 757 transitions. [2024-11-28 04:02:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:02:33,886 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-11-28 04:02:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:02:33,888 INFO L225 Difference]: With dead ends: 652 [2024-11-28 04:02:33,889 INFO L226 Difference]: Without dead ends: 628 [2024-11-28 04:02:33,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:02:33,890 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 117 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:02:33,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 316 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 04:02:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-28 04:02:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 487. [2024-11-28 04:02:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 483 states have (on average 1.1511387163561078) internal successors, (556), 483 states have internal predecessors, (556), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:02:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 560 transitions. [2024-11-28 04:02:34,006 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 560 transitions. Word has length 52 [2024-11-28 04:02:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:02:34,007 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 560 transitions. [2024-11-28 04:02:34,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:02:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 560 transitions. [2024-11-28 04:02:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 04:02:34,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:02:34,008 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:34,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-28 04:02:34,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 04:02:34,212 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:02:34,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1482289018, now seen corresponding path program 12 times [2024-11-28 04:02:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624346695] [2024-11-28 04:02:34,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:02:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:34,260 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-28 04:02:34,260 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:02:34,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624346695] [2024-11-28 04:02:34,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624346695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:02:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72746399] [2024-11-28 04:02:34,620 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 04:02:34,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:34,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:34,622 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:34,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-28 04:02:34,981 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-28 04:02:34,981 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:34,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-28 04:02:34,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 56 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:02:35,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 56 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:02:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72746399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:02:35,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:02:35,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2024-11-28 04:02:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432980109] [2024-11-28 04:02:35,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:35,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 04:02:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:35,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 04:02:35,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2024-11-28 04:02:35,473 INFO L87 Difference]: Start difference. First operand 487 states and 560 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:02:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:02:35,968 INFO L93 Difference]: Finished difference Result 970 states and 1120 transitions. [2024-11-28 04:02:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:02:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2024-11-28 04:02:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:02:35,972 INFO L225 Difference]: With dead ends: 970 [2024-11-28 04:02:35,973 INFO L226 Difference]: Without dead ends: 680 [2024-11-28 04:02:35,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 89 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2024-11-28 04:02:35,975 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 190 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:02:35,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 190 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 04:02:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-28 04:02:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 613. [2024-11-28 04:02:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 609 states have (on average 1.1691297208538587) internal successors, (712), 609 states have internal predecessors, (712), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:02:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 716 transitions. [2024-11-28 04:02:36,126 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 716 transitions. Word has length 54 [2024-11-28 04:02:36,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:02:36,126 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 716 transitions. [2024-11-28 04:02:36,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 23 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:02:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 716 transitions. [2024-11-28 04:02:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-28 04:02:36,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:02:36,127 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:36,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-28 04:02:36,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 04:02:36,328 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:02:36,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1561760601, now seen corresponding path program 7 times [2024-11-28 04:02:36,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:36,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864364380] [2024-11-28 04:02:36,328 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 04:02:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 04:02:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304999592] [2024-11-28 04:02:36,350 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 04:02:36,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:36,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:36,352 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:36,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-28 04:02:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:02:36,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-28 04:02:36,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:36,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:02:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:02:36,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:37,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2024-11-28 04:02:37,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 87 [2024-11-28 04:02:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-28 04:02:37,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:37,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864364380] [2024-11-28 04:02:37,868 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:02:37,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304999592] [2024-11-28 04:02:37,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304999592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:02:37,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:02:37,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-28 04:02:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716466980] [2024-11-28 04:02:37,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:37,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 04:02:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:37,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 04:02:37,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-28 04:02:37,870 INFO L87 Difference]: Start difference. First operand 613 states and 716 transitions. Second operand has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 21 states have internal predecessors, (88), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:02:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:02:38,876 INFO L93 Difference]: Finished difference Result 1399 states and 1699 transitions. [2024-11-28 04:02:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:02:38,877 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 21 states have internal predecessors, (88), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-28 04:02:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:02:38,880 INFO L225 Difference]: With dead ends: 1399 [2024-11-28 04:02:38,880 INFO L226 Difference]: Without dead ends: 1397 [2024-11-28 04:02:38,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2024-11-28 04:02:38,881 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 105 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:02:38,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 532 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 04:02:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-28 04:02:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 886. [2024-11-28 04:02:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 882 states have (on average 1.1870748299319729) internal successors, (1047), 882 states have internal predecessors, (1047), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:02:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1051 transitions. [2024-11-28 04:02:39,200 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1051 transitions. Word has length 54 [2024-11-28 04:02:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:02:39,200 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1051 transitions. [2024-11-28 04:02:39,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.190476190476191) internal successors, (88), 21 states have internal predecessors, (88), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-28 04:02:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1051 transitions. [2024-11-28 04:02:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-28 04:02:39,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:02:39,201 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:39,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-28 04:02:39,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 04:02:39,402 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:02:39,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1584105398, now seen corresponding path program 13 times [2024-11-28 04:02:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:39,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762578098] [2024-11-28 04:02:39,403 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 04:02:39,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 04:02:39,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668655487] [2024-11-28 04:02:39,455 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 04:02:39,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:39,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:39,459 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:39,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-28 04:02:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:02:39,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-28 04:02:39,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:39,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:02:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:02:40,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:40,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2024-11-28 04:02:40,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2024-11-28 04:02:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:02:40,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:02:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762578098] [2024-11-28 04:02:40,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:02:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668655487] [2024-11-28 04:02:40,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668655487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:02:40,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 04:02:40,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2024-11-28 04:02:40,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484552781] [2024-11-28 04:02:40,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 04:02:40,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-28 04:02:40,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:02:40,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-28 04:02:40,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2024-11-28 04:02:40,981 INFO L87 Difference]: Start difference. First operand 886 states and 1051 transitions. Second operand has 26 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:02:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:02:42,413 INFO L93 Difference]: Finished difference Result 985 states and 1163 transitions. [2024-11-28 04:02:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 04:02:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2024-11-28 04:02:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:02:42,416 INFO L225 Difference]: With dead ends: 985 [2024-11-28 04:02:42,416 INFO L226 Difference]: Without dead ends: 983 [2024-11-28 04:02:42,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2024-11-28 04:02:42,417 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 85 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:02:42,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 378 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 04:02:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-28 04:02:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 890. [2024-11-28 04:02:42,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 886 states have (on average 1.1862302483069977) internal successors, (1051), 886 states have internal predecessors, (1051), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:02:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1055 transitions. [2024-11-28 04:02:42,663 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1055 transitions. Word has length 56 [2024-11-28 04:02:42,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:02:42,664 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1055 transitions. [2024-11-28 04:02:42,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:02:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1055 transitions. [2024-11-28 04:02:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-28 04:02:42,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:02:42,666 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:02:42,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-28 04:02:42,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 04:02:42,869 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:02:42,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash 336335822, now seen corresponding path program 14 times [2024-11-28 04:02:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817951582] [2024-11-28 04:02:42,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:02:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:42,901 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:02:42,902 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:02:42,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982374790] [2024-11-28 04:02:42,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:02:42,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:02:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:42,907 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:02:42,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-28 04:02:43,032 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:02:43,032 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:02:43,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 04:02:43,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:02:43,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:02:43,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:02:43,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-28 04:02:43,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:02:43,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-28 04:02:43,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:02:43,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-28 04:02:43,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:02:43,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2024-11-28 04:02:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 04:02:44,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:02:52,978 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_488 Int) (v_ArrVal_492 Int) (v_ArrVal_491 Int) (|v_ULTIMATE.start_main_~j~0#1_409| Int) (|v_ULTIMATE.start_main_~j~0#1_408| Int)) (or (= (mod (+ |c_ULTIMATE.start_main_~C~0#1| 3) 4294967296) (mod (select (let ((.cse0 (* (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_488) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_409| 4)) v_ArrVal_491) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_408| 4)) v_ArrVal_492)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 12)) 4294967296)) (< |v_ULTIMATE.start_main_~j~0#1_408| (+ |v_ULTIMATE.start_main_~j~0#1_409| 1)) (< |v_ULTIMATE.start_main_~j~0#1_409| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2024-11-28 04:02:57,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_488 Int) (v_ArrVal_486 Int) (|v_ULTIMATE.start_main_~j~0#1_410| Int) (v_ArrVal_492 Int) (v_ArrVal_491 Int) (|v_ULTIMATE.start_main_~j~0#1_409| Int) (|v_ULTIMATE.start_main_~j~0#1_408| Int)) (or (= (mod (select (let ((.cse0 (* (* |c_ULTIMATE.start_main_~n~0#1| 4) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_486) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_410| 4)) v_ArrVal_488) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_409| 4)) v_ArrVal_491) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_408| 4)) v_ArrVal_492)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 12)) 4294967296) (mod (+ |c_ULTIMATE.start_main_~C~0#1| 3) 4294967296)) (< |v_ULTIMATE.start_main_~j~0#1_409| (+ |v_ULTIMATE.start_main_~j~0#1_410| 1)) (< |v_ULTIMATE.start_main_~j~0#1_408| (+ |v_ULTIMATE.start_main_~j~0#1_409| 1)) (< |v_ULTIMATE.start_main_~j~0#1_410| (+ |c_ULTIMATE.start_main_~j~0#1| 1)))) is different from false [2024-11-28 04:03:18,298 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_120| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~j~0#1_411| Int)) (or (< |v_ULTIMATE.start_main_~j~0#1_411| 0) (forall ((v_ArrVal_488 Int) (v_ArrVal_486 Int) (|v_ULTIMATE.start_main_~j~0#1_410| Int) (v_ArrVal_492 Int) (v_ArrVal_491 Int) (|v_ULTIMATE.start_main_~j~0#1_409| Int) (|v_ULTIMATE.start_main_~j~0#1_408| Int)) (or (= (mod (+ |c_ULTIMATE.start_main_~C~0#1| 3) 4294967296) (mod (select (let ((.cse0 (* (* |c_ULTIMATE.start_main_~n~0#1| 4) |v_ULTIMATE.start_main_~i~0#1_120|))) (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_411| 4)) v_ArrVal_486) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_410| 4)) v_ArrVal_488) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_409| 4)) v_ArrVal_491) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* |v_ULTIMATE.start_main_~j~0#1_408| 4)) v_ArrVal_492)) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 12)) 4294967296)) (< |v_ULTIMATE.start_main_~j~0#1_410| (+ |v_ULTIMATE.start_main_~j~0#1_411| 1)) (< |v_ULTIMATE.start_main_~j~0#1_409| (+ |v_ULTIMATE.start_main_~j~0#1_410| 1)) (< |v_ULTIMATE.start_main_~j~0#1_408| (+ |v_ULTIMATE.start_main_~j~0#1_409| 1)))))))) is different from false [2024-11-28 04:03:18,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 163 [2024-11-28 04:03:18,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 413157 treesize of output 411109 [2024-11-28 04:03:23,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817951582] [2024-11-28 04:03:23,639 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 04:03:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982374790] [2024-11-28 04:03:23,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982374790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:03:23,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-28 04:03:23,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2024-11-28 04:03:23,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379258211] [2024-11-28 04:03:23,640 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-28 04:03:23,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 04:03:23,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:23,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 04:03:23,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=899, Unknown=5, NotChecked=192, Total=1260 [2024-11-28 04:03:23,641 INFO L87 Difference]: Start difference. First operand 890 states and 1055 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:03:24,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:03:24,702 INFO L93 Difference]: Finished difference Result 1112 states and 1301 transitions. [2024-11-28 04:03:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 04:03:24,703 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2024-11-28 04:03:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:03:24,706 INFO L225 Difference]: With dead ends: 1112 [2024-11-28 04:03:24,706 INFO L226 Difference]: Without dead ends: 1110 [2024-11-28 04:03:24,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=177, Invalid=952, Unknown=5, NotChecked=198, Total=1332 [2024-11-28 04:03:24,707 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:03:24,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 270 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 04:03:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-11-28 04:03:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 902. [2024-11-28 04:03:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 898 states have (on average 1.1804008908685968) internal successors, (1060), 898 states have internal predecessors, (1060), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 04:03:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1064 transitions. [2024-11-28 04:03:24,966 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1064 transitions. Word has length 56 [2024-11-28 04:03:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:03:24,966 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1064 transitions. [2024-11-28 04:03:24,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 04:03:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1064 transitions. [2024-11-28 04:03:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 04:03:24,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:03:24,968 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:24,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-28 04:03:25,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:25,169 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:03:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash 816058645, now seen corresponding path program 15 times [2024-11-28 04:03:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:25,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238556352] [2024-11-28 04:03:25,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:03:25,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:25,218 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-28 04:03:25,218 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-28 04:03:25,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784903556] [2024-11-28 04:03:25,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:03:25,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:25,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:03:25,223 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:03:25,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9417a47b-b610-4d74-8585-18608dd0760c/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-28 04:03:26,490 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-28 04:03:26,490 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:03:26,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-28 04:03:26,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:03:26,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-28 04:03:26,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 04:03:26,806 INFO L349 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2024-11-28 04:03:26,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 60 [2024-11-28 04:03:26,969 INFO L349 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2024-11-28 04:03:26,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 98 [2024-11-28 04:03:27,283 INFO L349 Elim1Store]: treesize reduction 92, result has 27.6 percent of original size [2024-11-28 04:03:27,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 115 treesize of output 143 [2024-11-28 04:03:29,184 INFO L349 Elim1Store]: treesize reduction 257, result has 28.4 percent of original size [2024-11-28 04:03:29,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 292 treesize of output 331 [2024-11-28 04:03:31,454 INFO L349 Elim1Store]: treesize reduction 385, result has 20.3 percent of original size [2024-11-28 04:03:31,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 15 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 82 case distinctions, treesize of input 447 treesize of output 447 [2024-11-28 04:03:35,829 INFO L349 Elim1Store]: treesize reduction 449, result has 17.9 percent of original size [2024-11-28 04:03:35,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 15 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 109 case distinctions, treesize of input 533 treesize of output 515 [2024-11-28 04:03:50,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:03:50,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 15 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 221 treesize of output 219 [2024-11-28 04:03:52,112 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 04:03:52,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:04:18,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 126 [2024-11-28 04:04:18,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1825978 treesize of output 1824954 [2024-11-28 04:06:44,193 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:09:49,108 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse643 (+ |c_ULTIMATE.start_main_~j~0#1| (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse28 (= 2 .cse643)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~C~0#1| 2) 4294967296)) (.cse17 (= .cse643 1))) (let ((.cse14 (forall ((|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse642 (* |c_ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~i~0#1_128|))) (let ((.cse641 (+ |c_ULTIMATE.start_main_~n~0#1| .cse642))) (or (= .cse641 2) (= .cse642 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_128| 1) 0) (= .cse641 0) (= 2 .cse642)))))) (.cse43 (and (= (mod (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~C~0#1| |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) .cse2) .cse17)) (.cse214 (not .cse28)) (.cse419 (not .cse17)) (.cse9 (mod |c_ULTIMATE.start_main_~C~0#1| 4294967296)) (.cse1 (+ .cse2 4294967296)) (.cse8 (mod (+ |c_ULTIMATE.start_main_~C~0#1| 3) 4294967296))) (and (forall ((v_z_251 Int) (v_y_251 Int) (v_y_246 Int) (v_y_233 Int)) (let ((.cse7 (* v_y_246 4294967296)) (.cse6 (* v_y_251 4294967296))) (let ((.cse0 (+ .cse6 v_z_251 .cse9)) (.cse5 (+ .cse6 v_z_251)) (.cse4 (+ .cse6 v_z_251 .cse7)) (.cse3 (+ v_z_251 .cse8))) (or (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_246) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_251)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_251)))) (= .cse0 .cse1) (= .cse0 .cse2) (< 4294967295 .cse3) (< v_z_251 0) (< .cse4 0) (< .cse5 0) (< 4294967295 .cse5) (< 4294967295 .cse4) (< (+ .cse6 (* v_y_233 4294967296) v_z_251 .cse7 1) 0) (= .cse3 .cse2))))) (or (= (mod (+ |c_ULTIMATE.start_main_~j~0#1| |c_ULTIMATE.start_main_~C~0#1| |c_ULTIMATE.start_main_~i~0#1|) 4294967296) .cse2) (and (forall ((v_z_177 Int) (v_y_177 Int)) (let ((.cse12 (* |c_ULTIMATE.start_main_~n~0#1| v_z_177)) (.cse13 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_177) 4294967296))) (let ((.cse10 (+ v_z_177 .cse9)) (.cse11 (+ |c_ULTIMATE.start_main_~n~0#1| .cse12 .cse13))) (or (= .cse10 .cse1) (= .cse11 0) (< (+ (* v_y_177 4294967296) v_z_177 1) 0) (= .cse10 .cse2) (= (+ .cse12 .cse13) 0) (< 4294967295 v_z_177) (= .cse11 2) (< v_z_177 0))))) .cse14 (forall ((v_z_177 Int) (v_y_177 Int)) (let ((.cse15 (+ v_z_177 .cse9)) (.cse16 (+ |c_ULTIMATE.start_main_~n~0#1| (* |c_ULTIMATE.start_main_~n~0#1| v_z_177) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_177) 4294967296)))) (or (= .cse15 .cse1) (= .cse16 0) (< (+ (* v_y_177 4294967296) v_z_177 1) 0) (< .cse15 4294967296) (< 4294967295 v_z_177) (= .cse16 2)))) (or .cse17 (and (or (and (forall ((v_z_175 Int) (v_y_175 Int)) (let ((.cse20 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_175) 4294967296)) (.cse21 (* |c_ULTIMATE.start_main_~n~0#1| v_z_175))) (let ((.cse18 (+ |c_ULTIMATE.start_main_~n~0#1| .cse20 .cse21)) (.cse19 (+ v_z_175 .cse9))) (or (= .cse18 0) (< 4294967295 .cse19) (= (+ .cse20 .cse21) 0) (< v_z_175 0) (< (+ (* v_y_175 4294967296) v_z_175 1) 0) (= 2 .cse18) (= .cse19 .cse2))))) (forall ((v_z_175 Int) (v_y_175 Int)) (let ((.cse22 (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_175) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_175))) (.cse23 (+ v_z_175 .cse9))) (or (= .cse22 0) (= .cse23 .cse1) (< (+ (* v_y_175 4294967296) v_z_175 1) 0) (= 2 .cse22) (< .cse23 4294967296) (< 4294967295 v_z_175)))) (forall ((v_z_175 Int) (v_y_175 Int)) (let ((.cse25 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_175) 4294967296)) (.cse26 (* |c_ULTIMATE.start_main_~n~0#1| v_z_175))) (let ((.cse24 (+ |c_ULTIMATE.start_main_~n~0#1| .cse25 .cse26)) (.cse27 (+ v_z_175 .cse9))) (or (= .cse24 0) (= (+ .cse25 .cse26) 0) (< v_z_175 0) (= .cse27 .cse1) (< (+ (* v_y_175 4294967296) v_z_175 1) 0) (= 2 .cse24) (< 4294967295 v_z_175) (= .cse27 .cse2)))))) .cse28) (forall ((v_z_176 Int) (v_y_176 Int)) (let ((.cse31 (* |c_ULTIMATE.start_main_~n~0#1| v_z_176)) (.cse32 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_176) 4294967296))) (let ((.cse29 (+ v_z_176 .cse9)) (.cse30 (+ |c_ULTIMATE.start_main_~n~0#1| .cse31 .cse32))) (or (= .cse29 .cse2) (= .cse29 .cse1) (= .cse30 0) (= (+ .cse31 .cse32) 0) (< 4294967295 v_z_176) (< (+ (* v_y_176 4294967296) v_z_176 1) 0) (= .cse30 2) (< v_z_176 0))))) (forall ((v_z_176 Int) (v_y_176 Int)) (let ((.cse33 (+ v_z_176 .cse9)) (.cse34 (+ |c_ULTIMATE.start_main_~n~0#1| (* |c_ULTIMATE.start_main_~n~0#1| v_z_176) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_176) 4294967296)))) (or (< .cse33 4294967296) (= .cse33 .cse1) (= .cse34 0) (< 4294967295 v_z_176) (< (+ (* v_y_176 4294967296) v_z_176 1) 0) (= .cse34 2)))) (forall ((v_z_176 Int) (v_y_176 Int)) (let ((.cse37 (* |c_ULTIMATE.start_main_~n~0#1| v_z_176)) (.cse38 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_176) 4294967296))) (let ((.cse35 (+ v_z_176 .cse9)) (.cse36 (+ |c_ULTIMATE.start_main_~n~0#1| .cse37 .cse38))) (or (= .cse35 .cse2) (< 4294967295 .cse35) (= .cse36 0) (= (+ .cse37 .cse38) 0) (< (+ (* v_y_176 4294967296) v_z_176 1) 0) (= .cse36 2) (< v_z_176 0))))))) (forall ((v_z_177 Int) (v_y_177 Int)) (let ((.cse41 (* |c_ULTIMATE.start_main_~n~0#1| v_z_177)) (.cse42 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_177) 4294967296))) (let ((.cse40 (+ v_z_177 .cse9)) (.cse39 (+ |c_ULTIMATE.start_main_~n~0#1| .cse41 .cse42))) (or (= .cse39 0) (< (+ (* v_y_177 4294967296) v_z_177 1) 0) (= .cse40 .cse2) (= (+ .cse41 .cse42) 0) (< 4294967295 .cse40) (= .cse39 2) (< v_z_177 0)))))) .cse43) (forall ((v_y_260 Int) (v_y_233 Int) (v_z_260 Int)) (let ((.cse48 (* v_y_260 4294967296))) (let ((.cse47 (+ v_z_260 .cse48)) (.cse49 (+ v_z_260 .cse9)) (.cse44 (* |c_ULTIMATE.start_main_~n~0#1| v_z_260)) (.cse45 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) (.cse46 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_260) 4294967296))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse44 .cse45 .cse46) 0) (< 4294967295 .cse47) (< (+ (* v_y_233 4294967296) v_z_260 .cse48 1) 0) (< .cse47 0) (< .cse49 4294967296) (= .cse1 .cse49) (< 4294967295 v_z_260) (not (= (+ .cse44 .cse45 .cse46) 2)))))) (forall ((v_z_188 Int) (v_y_188 Int) (v_y_187 Int)) (let ((.cse52 (* v_y_188 4294967296))) (let ((.cse50 (+ v_z_188 .cse8)) (.cse51 (+ .cse52 v_z_188 .cse9)) (.cse53 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_188) 4294967296)) (.cse54 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296)) (.cse55 (* |c_ULTIMATE.start_main_~n~0#1| v_z_188))) (or (= .cse50 .cse2) (= .cse51 .cse1) (= .cse50 .cse1) (< 4294967295 (+ .cse52 v_z_188)) (not (= 2 (+ .cse53 .cse54 .cse55))) (< 4294967295 v_z_188) (< v_z_188 0) (< .cse51 4294967296) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse53 .cse54 .cse55) 1))))) (forall ((v_z_187 Int)) (let ((.cse56 (+ v_z_187 .cse9))) (or (= .cse56 .cse2) (forall ((v_y_187 Int)) (let ((.cse58 (* |c_ULTIMATE.start_main_~n~0#1| v_z_187)) (.cse59 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296))) (let ((.cse57 (+ |c_ULTIMATE.start_main_~n~0#1| .cse58 .cse59))) (or (= .cse57 0) (not (= (+ .cse58 .cse59) 2)) (= .cse57 1))))) (= .cse56 .cse1) (< v_z_187 0) (< 4294967295 v_z_187)))) (forall ((v_z_187 Int)) (let ((.cse60 (+ v_z_187 .cse9))) (or (< .cse60 4294967296) (forall ((v_y_187 Int)) (let ((.cse62 (* |c_ULTIMATE.start_main_~n~0#1| v_z_187)) (.cse63 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296))) (let ((.cse61 (+ |c_ULTIMATE.start_main_~n~0#1| .cse62 .cse63))) (or (= .cse61 0) (not (= (+ .cse62 .cse63) 2)) (= .cse61 1))))) (= .cse60 .cse1) (< 4294967295 v_z_187)))) (forall ((v_z_189 Int) (v_y_189 Int) (v_y_187 Int)) (let ((.cse64 (* v_y_189 4294967296))) (let ((.cse65 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296)) (.cse66 (* |c_ULTIMATE.start_main_~n~0#1| v_z_189)) (.cse67 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_189) 4294967296)) (.cse68 (+ .cse64 v_z_189)) (.cse69 (+ v_z_189 .cse8))) (or (= (+ .cse64 v_z_189 .cse9) .cse2) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse65 .cse66 .cse67) 1) (< .cse68 0) (< .cse69 4294967296) (not (= 2 (+ .cse65 .cse66 .cse67))) (< 4294967295 v_z_189) (< 4294967295 .cse68) (= .cse69 .cse1))))) (forall ((v_z_188 Int) (v_y_188 Int) (v_y_187 Int)) (let ((.cse72 (* v_y_188 4294967296))) (let ((.cse70 (+ v_z_188 .cse8)) (.cse71 (+ .cse72 v_z_188 .cse9)) (.cse73 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_188) 4294967296)) (.cse74 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296)) (.cse75 (* |c_ULTIMATE.start_main_~n~0#1| v_z_188))) (or (= .cse70 .cse2) (< 4294967295 .cse70) (= .cse71 .cse1) (< 4294967295 (+ .cse72 v_z_188)) (not (= 2 (+ .cse73 .cse74 .cse75))) (< v_z_188 0) (< .cse71 4294967296) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse73 .cse74 .cse75) 1))))) (forall ((v_y_260 Int) (v_y_233 Int) (v_z_260 Int)) (let ((.cse81 (* v_y_260 4294967296))) (let ((.cse80 (+ v_z_260 .cse81)) (.cse79 (+ v_z_260 .cse9)) (.cse76 (* |c_ULTIMATE.start_main_~n~0#1| v_z_260)) (.cse77 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) (.cse78 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_260) 4294967296))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse76 .cse77 .cse78) 0) (= .cse2 .cse79) (< 4294967295 .cse80) (< (+ (* v_y_233 4294967296) v_z_260 .cse81 1) 0) (< .cse80 0) (< 4294967295 .cse79) (< v_z_260 0) (not (= (+ .cse76 .cse77 .cse78) 2)))))) (forall ((v_y_260 Int) (v_y_233 Int) (v_z_260 Int)) (let ((.cse87 (* v_y_260 4294967296))) (let ((.cse86 (+ v_z_260 .cse87)) (.cse85 (+ v_z_260 .cse9)) (.cse82 (* |c_ULTIMATE.start_main_~n~0#1| v_z_260)) (.cse83 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) (.cse84 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_260) 4294967296))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse82 .cse83 .cse84) 0) (= .cse2 .cse85) (< 4294967295 .cse86) (< (+ (* v_y_233 4294967296) v_z_260 .cse87 1) 0) (< .cse86 0) (= .cse1 .cse85) (< v_z_260 0) (< 4294967295 v_z_260) (not (= (+ .cse82 .cse83 .cse84) 2)))))) (forall ((v_z_187 Int)) (let ((.cse88 (+ v_z_187 .cse9))) (or (= .cse88 .cse2) (forall ((v_y_187 Int)) (let ((.cse90 (* |c_ULTIMATE.start_main_~n~0#1| v_z_187)) (.cse91 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296))) (let ((.cse89 (+ |c_ULTIMATE.start_main_~n~0#1| .cse90 .cse91))) (or (= .cse89 0) (not (= (+ .cse90 .cse91) 2)) (= .cse89 1))))) (< 4294967295 .cse88) (< v_z_187 0)))) (forall ((v_z_189 Int) (v_y_189 Int) (v_y_187 Int)) (let ((.cse98 (* v_y_189 4294967296))) (let ((.cse93 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296)) (.cse94 (* |c_ULTIMATE.start_main_~n~0#1| v_z_189)) (.cse95 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_189) 4294967296)) (.cse92 (+ .cse98 v_z_189 .cse9)) (.cse96 (+ .cse98 v_z_189)) (.cse97 (+ v_z_189 .cse8))) (or (= .cse92 .cse2) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse93 .cse94 .cse95) 1) (< v_z_189 0) (< .cse96 0) (not (= 2 (+ .cse93 .cse94 .cse95))) (= .cse92 .cse1) (< 4294967295 v_z_189) (< 4294967295 .cse96) (= .cse97 .cse1) (= .cse97 .cse2))))) (forall ((v_y_190 Int) (v_z_190 Int) (v_y_187 Int)) (let ((.cse100 (* v_y_190 4294967296))) (let ((.cse99 (+ .cse100 v_z_190 .cse9)) (.cse101 (* |c_ULTIMATE.start_main_~n~0#1| v_z_190)) (.cse102 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296)) (.cse103 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_190) 4294967296))) (or (= .cse99 .cse2) (< 4294967295 v_z_190) (< (+ .cse100 v_z_190) 0) (= (+ v_z_190 .cse8) .cse1) (< 4294967295 .cse99) (not (= 2 (+ .cse101 .cse102 .cse103))) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse101 .cse102 .cse103) 1) (< v_z_190 0))))) (forall ((v_y_190 Int) (v_z_190 Int) (v_y_187 Int)) (let ((.cse105 (* v_y_190 4294967296))) (let ((.cse104 (+ .cse105 v_z_190 .cse9))) (or (= .cse104 .cse2) (< (+ .cse105 v_z_190) 0) (< 4294967295 (+ v_z_190 .cse8)) (< 4294967295 .cse104) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_190) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_190) 4294967296)))) (< v_z_190 0))))) (forall ((v_z_251 Int) (v_y_251 Int) (v_y_246 Int) (v_y_233 Int)) (let ((.cse110 (* v_y_246 4294967296)) (.cse107 (* v_y_251 4294967296))) (let ((.cse109 (+ .cse107 v_z_251)) (.cse108 (+ .cse107 v_z_251 .cse110)) (.cse106 (+ v_z_251 .cse8))) (or (= .cse106 .cse1) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_246) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_251)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_251)))) (< 4294967295 v_z_251) (= (+ .cse107 v_z_251 .cse9) .cse2) (< .cse108 0) (< .cse109 0) (< 4294967295 .cse109) (< 4294967295 .cse108) (< .cse106 4294967296) (< (+ .cse107 (* v_y_233 4294967296) v_z_251 .cse110 1) 0))))) (or (and (or (and (forall ((v_y_171 Int) (v_z_171 Int)) (let ((.cse111 (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_171) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_171))) (.cse112 (+ v_z_171 .cse9))) (or (= .cse111 0) (= .cse1 .cse112) (= 2 .cse111) (< 4294967295 v_z_171) (< (+ v_z_171 (* v_y_171 4294967296) 1) 0) (< .cse112 4294967296)))) .cse14 (forall ((v_y_171 Int) (v_z_171 Int)) (let ((.cse115 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_171) 4294967296)) (.cse116 (* |c_ULTIMATE.start_main_~n~0#1| v_z_171))) (let ((.cse114 (+ v_z_171 .cse9)) (.cse113 (+ |c_ULTIMATE.start_main_~n~0#1| .cse115 .cse116))) (or (= .cse113 0) (= .cse1 .cse114) (= (+ .cse115 .cse116) 0) (= .cse2 .cse114) (= 2 .cse113) (< 4294967295 v_z_171) (< v_z_171 0) (< (+ v_z_171 (* v_y_171 4294967296) 1) 0))))) (forall ((v_y_171 Int) (v_z_171 Int)) (let ((.cse119 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_171) 4294967296)) (.cse120 (* |c_ULTIMATE.start_main_~n~0#1| v_z_171))) (let ((.cse117 (+ v_z_171 .cse9)) (.cse118 (+ |c_ULTIMATE.start_main_~n~0#1| .cse119 .cse120))) (or (< 4294967295 .cse117) (= .cse118 0) (= (+ .cse119 .cse120) 0) (= .cse2 .cse117) (= 2 .cse118) (< v_z_171 0) (< (+ v_z_171 (* v_y_171 4294967296) 1) 0))))) (or (and (forall ((v_y_170 Int) (v_z_170 Int)) (let ((.cse121 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_170) 4294967296)) (.cse122 (* |c_ULTIMATE.start_main_~n~0#1| v_z_170))) (let ((.cse123 (+ |c_ULTIMATE.start_main_~n~0#1| .cse121 .cse122)) (.cse124 (+ v_z_170 .cse9))) (or (= (+ .cse121 .cse122) 0) (< v_z_170 0) (= .cse123 0) (< (+ (* v_y_170 4294967296) v_z_170 1) 0) (= .cse123 2) (= .cse2 .cse124) (< 4294967295 .cse124))))) (forall ((v_y_170 Int) (v_z_170 Int)) (let ((.cse126 (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_170) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_170))) (.cse125 (+ v_z_170 .cse9))) (or (= .cse1 .cse125) (= .cse126 0) (< (+ (* v_y_170 4294967296) v_z_170 1) 0) (< 4294967295 v_z_170) (= .cse126 2) (< .cse125 4294967296)))) (forall ((v_y_170 Int) (v_z_170 Int)) (let ((.cse127 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_170) 4294967296)) (.cse128 (* |c_ULTIMATE.start_main_~n~0#1| v_z_170))) (let ((.cse130 (+ |c_ULTIMATE.start_main_~n~0#1| .cse127 .cse128)) (.cse129 (+ v_z_170 .cse9))) (or (= (+ .cse127 .cse128) 0) (< v_z_170 0) (= .cse1 .cse129) (= .cse130 0) (< (+ (* v_y_170 4294967296) v_z_170 1) 0) (< 4294967295 v_z_170) (= .cse130 2) (= .cse2 .cse129)))))) .cse17)) .cse43) (forall ((v_y_173 Int) (v_z_173 Int)) (let ((.cse131 (* |c_ULTIMATE.start_main_~n~0#1| v_z_173)) (.cse132 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_173) 4294967296))) (or (not (= (+ .cse131 .cse132) 0)) (< 4294967295 v_z_173) (< v_z_173 0) (not (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse131 .cse132) 2))))) (forall ((v_z_174 Int) (v_y_174 Int)) (let ((.cse133 (+ v_z_174 .cse8))) (or (= .cse133 .cse1) (not (= (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_174) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_174)) 0)) (< 4294967295 v_z_174) (< (+ (* v_y_174 4294967296) v_z_174 1) 0) (< .cse133 4294967296)))) (forall ((v_z_174 Int) (v_y_174 Int)) (let ((.cse134 (+ v_z_174 .cse8))) (or (= .cse134 .cse1) (not (= (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_174) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_174)) 0)) (< v_z_174 0) (< 4294967295 v_z_174) (< (+ (* v_y_174 4294967296) v_z_174 1) 0) (= .cse134 .cse2)))) (forall ((v_z_174 Int) (v_y_174 Int)) (let ((.cse135 (+ v_z_174 .cse8))) (or (< 4294967295 .cse135) (not (= (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_174) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_174)) 0)) (< v_z_174 0) (< (+ (* v_y_174 4294967296) v_z_174 1) 0) (= .cse135 .cse2))))) .cse28) (or .cse17 (and (forall ((v_z_234 Int) (v_y_234 Int) (v_y_233 Int)) (let ((.cse141 (* v_y_234 4294967296))) (let ((.cse136 (* |c_ULTIMATE.start_main_~n~0#1| v_z_234)) (.cse137 (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_234))) (.cse138 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) (.cse140 (+ v_z_234 .cse9)) (.cse139 (+ .cse141 v_z_234))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse136 .cse137 .cse138) 0) (< .cse139 0) (< .cse140 4294967296) (not (= 2 (+ .cse136 .cse137 .cse138))) (< 4294967295 v_z_234) (< (+ .cse141 (* v_y_233 4294967296) v_z_234 1) 0) (= .cse1 .cse140) (< 4294967295 .cse139))))) (forall ((v_z_234 Int) (v_y_234 Int) (v_y_233 Int)) (let ((.cse147 (* v_y_234 4294967296))) (let ((.cse142 (* |c_ULTIMATE.start_main_~n~0#1| v_z_234)) (.cse143 (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_234))) (.cse144 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) (.cse146 (+ v_z_234 .cse9)) (.cse145 (+ .cse147 v_z_234))) (or (< v_z_234 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse142 .cse143 .cse144) 0) (< .cse145 0) (not (= 2 (+ .cse142 .cse143 .cse144))) (< 4294967295 v_z_234) (= .cse2 .cse146) (< (+ .cse147 (* v_y_233 4294967296) v_z_234 1) 0) (= .cse1 .cse146) (< 4294967295 .cse145))))) (forall ((v_z_234 Int) (v_y_234 Int) (v_y_233 Int)) (let ((.cse153 (* v_y_234 4294967296))) (let ((.cse148 (* |c_ULTIMATE.start_main_~n~0#1| v_z_234)) (.cse149 (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_234))) (.cse150 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) (.cse152 (+ v_z_234 .cse9)) (.cse151 (+ .cse153 v_z_234))) (or (< v_z_234 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse148 .cse149 .cse150) 0) (< .cse151 0) (< 4294967295 .cse152) (not (= 2 (+ .cse148 .cse149 .cse150))) (= .cse2 .cse152) (< (+ .cse153 (* v_y_233 4294967296) v_z_234 1) 0) (< 4294967295 .cse151))))))) (forall ((v_y_180 Int) (v_z_180 Int)) (let ((.cse154 (+ v_z_180 .cse8))) (or (not (= (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_180) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_180)) 0)) (< 4294967295 v_z_180) (< (+ (* v_y_180 4294967296) v_z_180 1) 0) (= .cse1 .cse154) (< .cse154 4294967296)))) (forall ((v_z_252 Int) (v_y_246 Int) (v_y_233 Int) (v_y_252 Int)) (let ((.cse159 (* v_y_246 4294967296)) (.cse156 (* v_y_252 4294967296))) (let ((.cse158 (+ v_z_252 .cse9 .cse156)) (.cse157 (+ v_z_252 .cse8)) (.cse155 (+ v_z_252 .cse159 .cse156))) (or (< 4294967295 .cse155) (< (+ v_z_252 .cse156) 0) (= .cse157 .cse1) (< 4294967295 .cse158) (= .cse2 .cse158) (< 4294967295 v_z_252) (< .cse157 4294967296) (< (+ (* v_y_233 4294967296) v_z_252 .cse159 .cse156 1) 0) (not (= (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_252) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_252) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_246) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) 2)) (< .cse155 0))))) (or (and (forall ((v_z_232 Int) (v_y_218 Int) (v_y_232 Int)) (let ((.cse165 (* v_y_232 4294967296))) (let ((.cse163 (+ .cse165 v_z_232)) (.cse164 (+ v_z_232 .cse9)) (.cse160 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_232) 4294967296)) (.cse161 (* |c_ULTIMATE.start_main_~n~0#1| v_z_232)) (.cse162 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse160 .cse161 .cse162) 0) (< 4294967295 .cse163) (< 4294967295 v_z_232) (= .cse1 .cse164) (< .cse163 0) (< (+ .cse165 v_z_232 (* v_y_218 4294967296) 1) 0) (< .cse164 4294967296) (not (= (+ .cse160 .cse161 .cse162) 2)))))) (forall ((v_z_232 Int) (v_y_218 Int) (v_y_232 Int)) (let ((.cse171 (* v_y_232 4294967296))) (let ((.cse169 (+ v_z_232 .cse9)) (.cse170 (+ .cse171 v_z_232)) (.cse166 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_232) 4294967296)) (.cse167 (* |c_ULTIMATE.start_main_~n~0#1| v_z_232)) (.cse168 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse166 .cse167 .cse168) 0) (< 4294967295 .cse169) (< 4294967295 .cse170) (= .cse2 .cse169) (< .cse170 0) (< (+ .cse171 v_z_232 (* v_y_218 4294967296) 1) 0) (not (= (+ .cse166 .cse167 .cse168) 2)) (< v_z_232 0))))) (forall ((v_z_231 Int) (v_y_218 Int) (v_y_226 Int) (v_y_231 Int)) (let ((.cse174 (* v_y_226 4294967296)) (.cse175 (* v_y_231 4294967296))) (let ((.cse172 (+ v_z_231 .cse8)) (.cse173 (+ .cse175 v_z_231 .cse9)) (.cse176 (+ .cse174 .cse175 v_z_231))) (or (= .cse172 .cse1) (= .cse173 .cse2) (< 4294967295 v_z_231) (< (+ .cse174 .cse175 v_z_231 (* v_y_218 4294967296) 1) 0) (< (+ .cse175 v_z_231) 0) (< .cse172 4294967296) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_231) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_231) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_226) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)))) (< 4294967295 .cse176) (< 4294967295 .cse173) (< .cse176 0))))) (forall ((v_z_230 Int) (v_y_218 Int) (v_y_226 Int) (v_y_230 Int)) (let ((.cse180 (* v_y_226 4294967296)) (.cse181 (* v_y_230 4294967296))) (let ((.cse178 (+ v_z_230 .cse8)) (.cse179 (+ .cse180 .cse181 v_z_230)) (.cse177 (+ .cse181 v_z_230))) (or (< .cse177 0) (< .cse178 4294967296) (< 4294967295 .cse179) (= .cse178 .cse1) (< .cse179 0) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_230)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_230) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_226) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)))) (< (+ .cse180 .cse181 v_z_230 (* v_y_218 4294967296) 1) 0) (< 4294967295 .cse177) (= (+ .cse181 v_z_230 .cse9) .cse2) (< 4294967295 v_z_230))))) (forall ((v_y_218 Int) (v_y_229 Int) (v_y_226 Int) (v_z_229 Int)) (let ((.cse184 (* v_y_226 4294967296)) (.cse183 (* v_y_229 4294967296))) (let ((.cse182 (+ v_z_229 .cse8)) (.cse185 (+ .cse183 v_z_229 .cse9)) (.cse186 (+ .cse183 .cse184 v_z_229))) (or (< 4294967295 .cse182) (< 4294967295 (+ .cse183 v_z_229)) (= .cse182 .cse2) (< v_z_229 0) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_229)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_229) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_226) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)))) (< (+ .cse183 .cse184 v_z_229 (* v_y_218 4294967296) 1) 0) (= .cse185 .cse1) (< .cse185 4294967296) (< .cse186 0) (< 4294967295 .cse186))))) (forall ((v_z_230 Int) (v_y_218 Int) (v_y_226 Int) (v_y_230 Int)) (let ((.cse190 (* v_y_226 4294967296)) (.cse191 (* v_y_230 4294967296))) (let ((.cse188 (+ .cse190 .cse191 v_z_230)) (.cse189 (+ v_z_230 .cse8)) (.cse187 (+ .cse191 v_z_230)) (.cse192 (+ .cse191 v_z_230 .cse9))) (or (< .cse187 0) (< 4294967295 .cse188) (= .cse189 .cse1) (< .cse188 0) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_230)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_230) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_226) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)))) (< (+ .cse190 .cse191 v_z_230 (* v_y_218 4294967296) 1) 0) (= .cse192 .cse1) (= .cse189 .cse2) (< 4294967295 .cse187) (= .cse192 .cse2) (< v_z_230 0) (< 4294967295 v_z_230))))) (forall ((v_z_231 Int) (v_y_218 Int) (v_y_226 Int) (v_y_231 Int)) (let ((.cse194 (* v_y_226 4294967296)) (.cse195 (* v_y_231 4294967296))) (let ((.cse193 (+ .cse195 v_z_231 .cse9)) (.cse196 (+ .cse194 .cse195 v_z_231))) (or (= (+ v_z_231 .cse8) .cse1) (< v_z_231 0) (= .cse193 .cse2) (< 4294967295 v_z_231) (< (+ .cse194 .cse195 v_z_231 (* v_y_218 4294967296) 1) 0) (< (+ .cse195 v_z_231) 0) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_231) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_231) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_226) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)))) (< 4294967295 .cse196) (< 4294967295 .cse193) (< .cse196 0))))) (forall ((v_y_218 Int) (v_y_229 Int) (v_y_226 Int) (v_z_229 Int)) (let ((.cse199 (* v_y_226 4294967296)) (.cse197 (* v_y_229 4294967296))) (let ((.cse198 (+ v_z_229 .cse8)) (.cse200 (+ .cse197 v_z_229 .cse9)) (.cse201 (+ .cse197 .cse199 v_z_229))) (or (< 4294967295 (+ .cse197 v_z_229)) (< 4294967295 v_z_229) (= .cse198 .cse2) (= .cse198 .cse1) (< v_z_229 0) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_229)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_229) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_226) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)))) (< (+ .cse197 .cse199 v_z_229 (* v_y_218 4294967296) 1) 0) (= .cse200 .cse1) (< .cse200 4294967296) (< .cse201 0) (< 4294967295 .cse201))))) (forall ((v_z_232 Int) (v_y_218 Int) (v_y_232 Int)) (let ((.cse207 (* v_y_232 4294967296))) (let ((.cse206 (+ v_z_232 .cse9)) (.cse205 (+ .cse207 v_z_232)) (.cse202 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_232) 4294967296)) (.cse203 (* |c_ULTIMATE.start_main_~n~0#1| v_z_232)) (.cse204 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse202 .cse203 .cse204) 0) (< 4294967295 .cse205) (< 4294967295 v_z_232) (= .cse1 .cse206) (= .cse2 .cse206) (< .cse205 0) (< (+ .cse207 v_z_232 (* v_y_218 4294967296) 1) 0) (not (= (+ .cse202 .cse203 .cse204) 2)) (< v_z_232 0))))) (forall ((v_z_230 Int) (v_y_218 Int) (v_y_226 Int) (v_y_230 Int)) (let ((.cse211 (* v_y_226 4294967296)) (.cse212 (* v_y_230 4294967296))) (let ((.cse209 (+ .cse211 .cse212 v_z_230)) (.cse210 (+ v_z_230 .cse8)) (.cse208 (+ .cse212 v_z_230)) (.cse213 (+ .cse212 v_z_230 .cse9))) (or (< .cse208 0) (< 4294967295 .cse209) (< .cse209 0) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_230)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_230) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_226) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)))) (< 4294967295 .cse210) (< (+ .cse211 .cse212 v_z_230 (* v_y_218 4294967296) 1) 0) (= .cse213 .cse1) (= .cse210 .cse2) (< 4294967295 .cse208) (= .cse213 .cse2) (< v_z_230 0))))) (or .cse214 (and (forall ((v_y_208 Int) (v_y_216 Int) (v_z_216 Int) (v_y_212 Int)) (let ((.cse220 (* v_y_212 4294967296)) (.cse219 (* v_y_216 4294967296))) (let ((.cse217 (+ .cse219 v_z_216)) (.cse216 (+ .cse219 v_z_216 .cse9)) (.cse218 (+ v_z_216 .cse8)) (.cse215 (+ .cse219 .cse220 v_z_216))) (or (< 4294967295 .cse215) (= .cse1 .cse216) (< 4294967295 v_z_216) (< .cse217 0) (< 4294967295 .cse217) (= .cse2 .cse216) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_216)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_216) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_212) 4294967296)))) (= .cse218 .cse2) (= .cse218 .cse1) (< (+ .cse219 .cse220 v_z_216 (* v_y_208 4294967296) 1) 0) (< v_z_216 0) (< .cse215 0))))) (forall ((v_y_208 Int) (v_y_216 Int) (v_z_216 Int) (v_y_212 Int)) (let ((.cse225 (* v_y_212 4294967296)) (.cse223 (* v_y_216 4294967296))) (let ((.cse222 (+ .cse223 v_z_216)) (.cse224 (+ v_z_216 .cse8)) (.cse221 (+ .cse223 .cse225 v_z_216))) (or (< 4294967295 .cse221) (< 4294967295 v_z_216) (< .cse222 0) (< 4294967295 .cse222) (= .cse2 (+ .cse223 v_z_216 .cse9)) (< .cse224 4294967296) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_216)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_216) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_212) 4294967296)))) (= .cse224 .cse1) (< (+ .cse223 .cse225 v_z_216 (* v_y_208 4294967296) 1) 0) (< .cse221 0))))) (forall ((v_z_210 Int) (v_y_208 Int) (v_y_210 Int)) (let ((.cse229 (* v_y_210 4294967296))) (let ((.cse226 (* |c_ULTIMATE.start_main_~n~0#1| v_z_210)) (.cse227 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296)) (.cse228 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_210) 4294967296)) (.cse230 (+ v_z_210 .cse229)) (.cse231 (+ v_z_210 .cse9))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse226 .cse227 .cse228) 0) (< 4294967295 v_z_210) (< (+ v_z_210 (* v_y_208 4294967296) .cse229 1) 0) (< 4294967295 .cse230) (< .cse231 4294967296) (not (= 2 (+ .cse226 .cse227 .cse228))) (< .cse230 0) (= .cse231 .cse1))))) (forall ((v_y_208 Int) (v_z_214 Int) (v_y_214 Int) (v_y_212 Int)) (let ((.cse234 (* v_y_214 4294967296))) (let ((.cse233 (+ (* v_y_212 4294967296) v_z_214 .cse234)) (.cse232 (+ v_z_214 .cse234 .cse9))) (or (< 4294967295 .cse232) (< 4294967295 .cse233) (< v_z_214 0) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_214) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_212) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_214) 4294967296)) 2)) (< 4294967295 (+ v_z_214 .cse8)) (< .cse233 0) (< (+ v_z_214 .cse234) 0) (= .cse232 .cse2))))) (forall ((v_z_210 Int) (v_y_208 Int) (v_y_210 Int)) (let ((.cse239 (* v_y_210 4294967296))) (let ((.cse235 (* |c_ULTIMATE.start_main_~n~0#1| v_z_210)) (.cse236 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296)) (.cse237 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_210) 4294967296)) (.cse240 (+ v_z_210 .cse239)) (.cse238 (+ v_z_210 .cse9))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse235 .cse236 .cse237) 0) (= .cse238 .cse2) (< v_z_210 0) (< 4294967295 v_z_210) (< (+ v_z_210 (* v_y_208 4294967296) .cse239 1) 0) (< 4294967295 .cse240) (not (= 2 (+ .cse235 .cse236 .cse237))) (< .cse240 0) (= .cse238 .cse1))))) (forall ((v_y_208 Int) (v_y_216 Int) (v_z_216 Int) (v_y_212 Int)) (let ((.cse246 (* v_y_212 4294967296)) (.cse245 (* v_y_216 4294967296))) (let ((.cse244 (+ .cse245 v_z_216)) (.cse243 (+ .cse245 v_z_216 .cse9)) (.cse242 (+ v_z_216 .cse8)) (.cse241 (+ .cse245 .cse246 v_z_216))) (or (< 4294967295 .cse241) (< 4294967295 .cse242) (= .cse1 .cse243) (< .cse244 0) (< 4294967295 .cse244) (= .cse2 .cse243) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_216)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_216) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_212) 4294967296)))) (= .cse242 .cse2) (< (+ .cse245 .cse246 v_z_216 (* v_y_208 4294967296) 1) 0) (< v_z_216 0) (< .cse241 0))))) (forall ((v_y_208 Int) (v_y_217 Int) (v_z_217 Int) (v_y_212 Int)) (let ((.cse249 (* v_y_212 4294967296)) (.cse250 (* v_y_217 4294967296))) (let ((.cse248 (+ .cse249 .cse250 v_z_217)) (.cse247 (+ .cse250 v_z_217 .cse9)) (.cse251 (+ v_z_217 .cse8))) (or (< v_z_217 0) (not (= (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_212) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_217) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_217) 4294967296)) 2)) (< .cse247 4294967296) (< .cse248 0) (< 4294967295 .cse248) (< (+ .cse249 .cse250 v_z_217 (* v_y_208 4294967296) 1) 0) (< 4294967295 .cse251) (= .cse247 .cse1) (< 4294967295 (+ .cse250 v_z_217)) (= .cse251 .cse2))))) (forall ((v_y_208 Int) (v_y_217 Int) (v_z_217 Int) (v_y_212 Int)) (let ((.cse255 (* v_y_212 4294967296)) (.cse256 (* v_y_217 4294967296))) (let ((.cse254 (+ .cse255 .cse256 v_z_217)) (.cse253 (+ .cse256 v_z_217 .cse9)) (.cse252 (+ v_z_217 .cse8))) (or (= .cse252 .cse1) (< v_z_217 0) (not (= (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_212) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_217) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_217) 4294967296)) 2)) (< .cse253 4294967296) (< .cse254 0) (< 4294967295 .cse254) (< 4294967295 v_z_217) (< (+ .cse255 .cse256 v_z_217 (* v_y_208 4294967296) 1) 0) (= .cse253 .cse1) (< 4294967295 (+ .cse256 v_z_217)) (= .cse252 .cse2))))) (forall ((v_y_208 Int) (v_z_214 Int) (v_y_214 Int) (v_y_212 Int)) (let ((.cse260 (* v_y_212 4294967296)) (.cse261 (* v_y_214 4294967296))) (let ((.cse258 (+ v_z_214 .cse8)) (.cse259 (+ .cse260 v_z_214 .cse261)) (.cse257 (+ v_z_214 .cse261 .cse9))) (or (< 4294967295 .cse257) (= .cse1 .cse258) (< 4294967295 .cse259) (< (+ .cse260 v_z_214 (* v_y_208 4294967296) .cse261 1) 0) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_214) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_212) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_214) 4294967296)) 2)) (< .cse258 4294967296) (< 4294967295 v_z_214) (< .cse259 0) (< (+ v_z_214 .cse261) 0) (= .cse257 .cse2))))) (forall ((v_y_208 Int) (v_z_214 Int) (v_y_214 Int) (v_y_212 Int)) (let ((.cse264 (* v_y_212 4294967296)) (.cse265 (* v_y_214 4294967296))) (let ((.cse263 (+ .cse264 v_z_214 .cse265)) (.cse262 (+ v_z_214 .cse265 .cse9))) (or (< 4294967295 .cse262) (= .cse1 (+ v_z_214 .cse8)) (< 4294967295 .cse263) (< (+ .cse264 v_z_214 (* v_y_208 4294967296) .cse265 1) 0) (< v_z_214 0) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_214) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_212) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_214) 4294967296)) 2)) (< 4294967295 v_z_214) (< .cse263 0) (< (+ v_z_214 .cse265) 0) (= .cse262 .cse2))))) (forall ((v_z_210 Int) (v_y_208 Int) (v_y_210 Int)) (let ((.cse270 (* v_y_210 4294967296))) (let ((.cse269 (+ v_z_210 .cse9)) (.cse266 (* |c_ULTIMATE.start_main_~n~0#1| v_z_210)) (.cse267 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_208) 4294967296)) (.cse268 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_210) 4294967296)) (.cse271 (+ v_z_210 .cse270))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse266 .cse267 .cse268) 0) (= .cse269 .cse2) (< v_z_210 0) (< (+ v_z_210 (* v_y_208 4294967296) .cse270 1) 0) (< 4294967295 .cse271) (< 4294967295 .cse269) (not (= 2 (+ .cse266 .cse267 .cse268))) (< .cse271 0))))))) (or (and (forall ((v_z_222 Int)) (let ((.cse272 (+ v_z_222 .cse8))) (or (< v_z_222 0) (= .cse272 .cse2) (< 4294967295 v_z_222) (forall ((v_y_218 Int) (v_y_221 Int) (v_y_222 Int)) (let ((.cse276 (* v_y_221 4294967296)) (.cse275 (* v_y_222 4294967296))) (let ((.cse273 (+ v_z_222 .cse9 .cse275)) (.cse277 (+ v_z_222 .cse275)) (.cse274 (+ v_z_222 .cse275 .cse276))) (or (= .cse273 .cse1) (< .cse274 0) (< (+ v_z_222 .cse275 (* v_y_218 4294967296) .cse276 1) 0) (= .cse273 .cse2) (< 4294967295 .cse277) (< .cse277 0) (< 4294967295 .cse274) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_222) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_222) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_221) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) 2)))))) (= .cse272 .cse1)))) (forall ((v_z_222 Int)) (let ((.cse281 (+ v_z_222 .cse8))) (or (forall ((v_y_218 Int) (v_y_221 Int) (v_y_222 Int)) (let ((.cse280 (* v_y_222 4294967296))) (let ((.cse279 (+ v_z_222 .cse9 .cse280)) (.cse278 (+ v_z_222 .cse280 (* v_y_221 4294967296)))) (or (< .cse278 0) (= .cse279 .cse2) (< 4294967295 .cse279) (< (+ v_z_222 .cse280) 0) (< 4294967295 .cse278) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_222) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_222) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_221) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) 2)))))) (< v_z_222 0) (= .cse281 .cse2) (< 4294967295 .cse281)))) (forall ((v_y_218 Int) (v_z_223 Int) (v_y_223 Int)) (let ((.cse286 (* v_y_223 4294967296))) (let ((.cse282 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_223) 4294967296)) (.cse283 (* |c_ULTIMATE.start_main_~n~0#1| v_z_223)) (.cse284 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) (.cse287 (+ .cse286 v_z_223)) (.cse285 (+ v_z_223 .cse9))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse282 .cse283 .cse284) 0) (not (= (+ .cse282 .cse283 .cse284) 2)) (< 4294967295 .cse285) (< (+ .cse286 v_z_223 (* v_y_218 4294967296) 1) 0) (< 4294967295 .cse287) (< v_z_223 0) (< .cse287 0) (= .cse285 .cse2))))) (forall ((v_y_218 Int) (v_z_223 Int) (v_y_223 Int)) (let ((.cse292 (* v_y_223 4294967296))) (let ((.cse288 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_223) 4294967296)) (.cse289 (* |c_ULTIMATE.start_main_~n~0#1| v_z_223)) (.cse290 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) (.cse291 (+ v_z_223 .cse9)) (.cse293 (+ .cse292 v_z_223))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse288 .cse289 .cse290) 0) (not (= (+ .cse288 .cse289 .cse290) 2)) (= .cse291 .cse1) (< .cse291 4294967296) (< (+ .cse292 v_z_223 (* v_y_218 4294967296) 1) 0) (< 4294967295 .cse293) (< .cse293 0) (< 4294967295 v_z_223))))) (forall ((v_y_218 Int) (v_z_223 Int) (v_y_223 Int)) (let ((.cse298 (* v_y_223 4294967296))) (let ((.cse294 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_223) 4294967296)) (.cse295 (* |c_ULTIMATE.start_main_~n~0#1| v_z_223)) (.cse296 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) (.cse299 (+ .cse298 v_z_223)) (.cse297 (+ v_z_223 .cse9))) (or (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse294 .cse295 .cse296) 0) (not (= (+ .cse294 .cse295 .cse296) 2)) (= .cse297 .cse1) (< (+ .cse298 v_z_223 (* v_y_218 4294967296) 1) 0) (< 4294967295 .cse299) (< v_z_223 0) (< .cse299 0) (< 4294967295 v_z_223) (= .cse297 .cse2))))) (forall ((v_z_222 Int)) (let ((.cse304 (+ v_z_222 .cse8))) (or (< v_z_222 0) (forall ((v_y_218 Int) (v_y_221 Int) (v_y_222 Int)) (let ((.cse302 (* v_y_221 4294967296)) (.cse301 (* v_y_222 4294967296))) (let ((.cse303 (+ v_z_222 .cse9 .cse301)) (.cse300 (+ v_z_222 .cse301 .cse302))) (or (< .cse300 0) (< (+ v_z_222 .cse301 (* v_y_218 4294967296) .cse302 1) 0) (= .cse303 .cse2) (< 4294967295 .cse303) (< (+ v_z_222 .cse301) 0) (< 4294967295 .cse300) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_222) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_222) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_221) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) 2)))))) (= .cse304 .cse2) (< 4294967295 v_z_222) (= .cse304 .cse1)))) (forall ((v_z_222 Int)) (let ((.cse309 (+ v_z_222 .cse8))) (or (< v_z_222 0) (forall ((v_y_218 Int) (v_y_221 Int) (v_y_222 Int)) (let ((.cse308 (* v_y_221 4294967296)) (.cse307 (* v_y_222 4294967296))) (let ((.cse305 (+ v_z_222 .cse9 .cse307)) (.cse306 (+ v_z_222 .cse307 .cse308))) (or (= .cse305 .cse1) (< .cse306 0) (< (+ v_z_222 .cse307 (* v_y_218 4294967296) .cse308 1) 0) (< .cse305 4294967296) (< 4294967295 (+ v_z_222 .cse307)) (< 4294967295 .cse306) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_222) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_222) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_221) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) 2)))))) (= .cse309 .cse2) (< 4294967295 .cse309)))) (forall ((v_z_222 Int)) (let ((.cse310 (+ v_z_222 .cse8))) (or (< v_z_222 0) (= .cse310 .cse2) (< 4294967295 .cse310) (forall ((v_y_218 Int) (v_y_221 Int) (v_y_222 Int)) (let ((.cse314 (* v_y_221 4294967296)) (.cse313 (* v_y_222 4294967296))) (let ((.cse311 (+ v_z_222 .cse9 .cse313)) (.cse315 (+ v_z_222 .cse313)) (.cse312 (+ v_z_222 .cse313 .cse314))) (or (= .cse311 .cse1) (< .cse312 0) (< (+ v_z_222 .cse313 (* v_y_218 4294967296) .cse314 1) 0) (= .cse311 .cse2) (< 4294967295 .cse315) (< .cse315 0) (< 4294967295 .cse312) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_222) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_222) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_221) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) 2))))))))) (forall ((v_z_222 Int)) (let ((.cse316 (+ v_z_222 .cse8))) (or (< .cse316 4294967296) (forall ((v_y_218 Int) (v_y_221 Int) (v_y_222 Int)) (let ((.cse319 (* v_y_221 4294967296)) (.cse318 (* v_y_222 4294967296))) (let ((.cse320 (+ v_z_222 .cse9 .cse318)) (.cse317 (+ v_z_222 .cse318 .cse319))) (or (< .cse317 0) (< (+ v_z_222 .cse318 (* v_y_218 4294967296) .cse319 1) 0) (= .cse320 .cse2) (< 4294967295 .cse320) (< (+ v_z_222 .cse318) 0) (< 4294967295 .cse317) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_222) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_222) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_221) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) 2)))))) (< 4294967295 v_z_222) (= .cse316 .cse1)))) (forall ((v_z_222 Int)) (let ((.cse321 (+ v_z_222 .cse8))) (or (< .cse321 4294967296) (forall ((v_y_218 Int) (v_y_221 Int) (v_y_222 Int)) (let ((.cse324 (* v_y_221 4294967296)) (.cse323 (* v_y_222 4294967296))) (let ((.cse325 (+ v_z_222 .cse323)) (.cse322 (+ v_z_222 .cse323 .cse324))) (or (< .cse322 0) (< (+ v_z_222 .cse323 (* v_y_218 4294967296) .cse324 1) 0) (= (+ v_z_222 .cse9 .cse323) .cse2) (< 4294967295 .cse325) (< .cse325 0) (< 4294967295 .cse322) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_222) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_222) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_221) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) 2)))))) (< 4294967295 v_z_222) (= .cse321 .cse1)))) (forall ((v_z_222 Int)) (let ((.cse330 (+ v_z_222 .cse8))) (or (< v_z_222 0) (forall ((v_y_218 Int) (v_y_221 Int) (v_y_222 Int)) (let ((.cse329 (* v_y_221 4294967296)) (.cse328 (* v_y_222 4294967296))) (let ((.cse326 (+ v_z_222 .cse9 .cse328)) (.cse327 (+ v_z_222 .cse328 .cse329))) (or (= .cse326 .cse1) (< .cse327 0) (< (+ v_z_222 .cse328 (* v_y_218 4294967296) .cse329 1) 0) (< .cse326 4294967296) (< 4294967295 (+ v_z_222 .cse328)) (< 4294967295 .cse327) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_222) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_222) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_221) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)) 2)))))) (= .cse330 .cse2) (< 4294967295 v_z_222) (= .cse330 .cse1))))) .cse28) (forall ((v_z_231 Int) (v_y_218 Int) (v_y_226 Int) (v_y_231 Int)) (let ((.cse332 (* v_y_231 4294967296))) (let ((.cse331 (+ .cse332 v_z_231 .cse9)) (.cse333 (+ (* v_y_226 4294967296) .cse332 v_z_231))) (or (< 4294967295 (+ v_z_231 .cse8)) (< v_z_231 0) (= .cse331 .cse2) (< (+ .cse332 v_z_231) 0) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_231) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_231) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_226) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_218) 4294967296)))) (< 4294967295 .cse333) (< 4294967295 .cse331) (< .cse333 0)))))) .cse17) (or .cse214 (and (forall ((v_z_258 Int) (v_y_258 Int) (v_y_233 Int) (v_y_253 Int)) (let ((.cse338 (* v_y_253 4294967296)) (.cse337 (* v_y_258 4294967296))) (let ((.cse335 (+ .cse337 v_z_258 .cse9)) (.cse336 (+ .cse337 v_z_258 .cse338)) (.cse334 (+ v_z_258 .cse8))) (or (= .cse334 .cse2) (< .cse335 4294967296) (< .cse336 0) (= .cse335 .cse1) (< v_z_258 0) (< 4294967295 (+ .cse337 v_z_258)) (< (+ .cse337 (* v_y_233 4294967296) v_z_258 .cse338 1) 0) (< 4294967295 v_z_258) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_253) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_258) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_258)))) (< 4294967295 .cse336) (= .cse334 .cse1))))) (forall ((v_z_256 Int) (v_y_256 Int) (v_y_233 Int) (v_y_253 Int)) (let ((.cse339 (* v_y_256 4294967296)) (.cse343 (* v_y_253 4294967296))) (let ((.cse341 (+ v_z_256 .cse8)) (.cse340 (+ .cse339 v_z_256 .cse343)) (.cse342 (+ .cse339 v_z_256))) (or (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_253) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_256) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_256)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (= .cse2 (+ .cse339 v_z_256 .cse9)) (< 4294967295 .cse340) (= .cse1 .cse341) (< 4294967295 .cse342) (< 4294967295 v_z_256) (< (+ (* v_y_233 4294967296) .cse339 v_z_256 .cse343 1) 0) (< .cse341 4294967296) (< .cse340 0) (< .cse342 0))))) (forall ((v_z_259 Int) (v_y_259 Int) (v_y_233 Int) (v_y_253 Int)) (let ((.cse348 (* v_y_253 4294967296)) (.cse349 (* v_y_259 4294967296))) (let ((.cse344 (+ v_z_259 .cse9 .cse349)) (.cse345 (+ v_z_259 .cse349)) (.cse347 (+ v_z_259 .cse8)) (.cse346 (+ v_z_259 .cse348 .cse349))) (or (= .cse344 .cse1) (< .cse345 0) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_253) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_259) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_259)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (= .cse344 .cse2) (< 4294967295 .cse346) (= .cse347 .cse2) (< (+ (* v_y_233 4294967296) v_z_259 .cse348 .cse349 1) 0) (< 4294967295 .cse345) (< 4294967295 v_z_259) (= .cse347 .cse1) (< .cse346 0) (< v_z_259 0))))) (forall ((v_z_259 Int) (v_y_259 Int) (v_y_233 Int) (v_y_253 Int)) (let ((.cse354 (* v_y_253 4294967296)) (.cse355 (* v_y_259 4294967296))) (let ((.cse350 (+ v_z_259 .cse9 .cse355)) (.cse352 (+ v_z_259 .cse8)) (.cse351 (+ v_z_259 .cse355)) (.cse353 (+ v_z_259 .cse354 .cse355))) (or (= .cse350 .cse1) (< .cse351 0) (< 4294967295 .cse352) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_253) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_259) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_259)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (= .cse350 .cse2) (< 4294967295 .cse353) (= .cse352 .cse2) (< (+ (* v_y_233 4294967296) v_z_259 .cse354 .cse355 1) 0) (< 4294967295 .cse351) (< .cse353 0) (< v_z_259 0))))) (forall ((v_z_258 Int) (v_y_258 Int) (v_y_233 Int) (v_y_253 Int)) (let ((.cse360 (* v_y_253 4294967296)) (.cse359 (* v_y_258 4294967296))) (let ((.cse357 (+ .cse359 v_z_258 .cse9)) (.cse356 (+ v_z_258 .cse8)) (.cse358 (+ .cse359 v_z_258 .cse360))) (or (= .cse356 .cse2) (< .cse357 4294967296) (< .cse358 0) (= .cse357 .cse1) (< 4294967295 .cse356) (< v_z_258 0) (< 4294967295 (+ .cse359 v_z_258)) (< (+ .cse359 (* v_y_233 4294967296) v_z_258 .cse360 1) 0) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_253) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_258) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_258)))) (< 4294967295 .cse358))))) (forall ((v_z_256 Int) (v_y_256 Int) (v_y_233 Int) (v_y_253 Int)) (let ((.cse363 (* v_y_256 4294967296))) (let ((.cse361 (+ .cse363 v_z_256 .cse9)) (.cse362 (+ .cse363 v_z_256 (* v_y_253 4294967296)))) (or (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_253) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_256) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_256)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< v_z_256 0) (= .cse2 .cse361) (< 4294967295 .cse362) (< 4294967295 .cse361) (< 4294967295 (+ v_z_256 .cse8)) (< .cse362 0) (< (+ .cse363 v_z_256) 0))))) (forall ((v_z_256 Int) (v_y_256 Int) (v_y_233 Int) (v_y_253 Int)) (let ((.cse367 (* v_y_253 4294967296)) (.cse366 (* v_y_256 4294967296))) (let ((.cse364 (+ .cse366 v_z_256 .cse9)) (.cse365 (+ .cse366 v_z_256 .cse367))) (or (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_253) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_256) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_256)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< v_z_256 0) (= .cse2 .cse364) (< 4294967295 .cse365) (= .cse1 (+ v_z_256 .cse8)) (< 4294967295 .cse364) (< 4294967295 v_z_256) (< (+ (* v_y_233 4294967296) .cse366 v_z_256 .cse367 1) 0) (< .cse365 0) (< (+ .cse366 v_z_256) 0))))) (forall ((v_z_259 Int) (v_y_259 Int) (v_y_233 Int) (v_y_253 Int)) (let ((.cse372 (* v_y_253 4294967296)) (.cse370 (* v_y_259 4294967296))) (let ((.cse369 (+ v_z_259 .cse370)) (.cse368 (+ v_z_259 .cse8)) (.cse371 (+ v_z_259 .cse372 .cse370))) (or (< .cse368 4294967296) (< .cse369 0) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_253) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_259) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_259)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (= (+ v_z_259 .cse9 .cse370) .cse2) (< 4294967295 .cse371) (< (+ (* v_y_233 4294967296) v_z_259 .cse372 .cse370 1) 0) (< 4294967295 .cse369) (< 4294967295 v_z_259) (= .cse368 .cse1) (< .cse371 0))))))) (forall ((v_z_252 Int) (v_y_246 Int) (v_y_233 Int) (v_y_252 Int)) (let ((.cse376 (* v_y_246 4294967296)) (.cse374 (* v_y_252 4294967296))) (let ((.cse375 (+ v_z_252 .cse9 .cse374)) (.cse373 (+ v_z_252 .cse376 .cse374))) (or (< 4294967295 .cse373) (< (+ v_z_252 .cse374) 0) (= (+ v_z_252 .cse8) .cse1) (< 4294967295 .cse375) (= .cse2 .cse375) (< v_z_252 0) (< 4294967295 v_z_252) (< (+ (* v_y_233 4294967296) v_z_252 .cse376 .cse374 1) 0) (not (= (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_252) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_252) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_246) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) 2)) (< .cse373 0))))) (forall ((v_y_180 Int) (v_z_180 Int)) (let ((.cse377 (+ v_z_180 .cse8))) (or (< 4294967295 .cse377) (not (= (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_180) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_180)) 0)) (= .cse2 .cse377) (< v_z_180 0) (< (+ (* v_y_180 4294967296) v_z_180 1) 0)))) (or (and (forall ((v_z_237 Int)) (let ((.cse378 (+ v_z_237 .cse8))) (or (< .cse378 4294967296) (forall ((v_y_237 Int) (v_y_235 Int) (v_y_233 Int)) (let ((.cse381 (* v_y_235 4294967296)) (.cse382 (* v_y_237 4294967296))) (let ((.cse380 (+ .cse381 v_z_237 .cse382)) (.cse379 (+ v_z_237 .cse382 .cse9))) (or (< 4294967295 .cse379) (< 4294967295 .cse380) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_237) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_235) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_237)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) .cse381 v_z_237 .cse382 1) 0) (< (+ v_z_237 .cse382) 0) (< .cse380 0) (= .cse379 .cse2))))) (= .cse378 .cse1) (< 4294967295 v_z_237)))) (forall ((v_z_237 Int)) (let ((.cse387 (+ v_z_237 .cse8))) (or (forall ((v_y_237 Int) (v_y_235 Int) (v_y_233 Int)) (let ((.cse385 (* v_y_235 4294967296)) (.cse386 (* v_y_237 4294967296))) (let ((.cse384 (+ .cse385 v_z_237 .cse386)) (.cse383 (+ v_z_237 .cse386 .cse9))) (or (< 4294967295 .cse383) (< 4294967295 .cse384) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_237) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_235) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_237)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) .cse385 v_z_237 .cse386 1) 0) (< (+ v_z_237 .cse386) 0) (< .cse384 0) (= .cse383 .cse2))))) (= .cse387 .cse1) (< v_z_237 0) (< 4294967295 v_z_237) (= .cse387 .cse2)))) (forall ((v_z_237 Int)) (let ((.cse388 (+ v_z_237 .cse8))) (or (< 4294967295 .cse388) (< v_z_237 0) (forall ((v_y_237 Int) (v_y_235 Int) (v_y_233 Int)) (let ((.cse391 (* v_y_237 4294967296))) (let ((.cse390 (+ (* v_y_235 4294967296) v_z_237 .cse391)) (.cse389 (+ v_z_237 .cse391 .cse9))) (or (< 4294967295 .cse389) (< 4294967295 .cse390) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_237) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_235) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_237)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ v_z_237 .cse391) 0) (< .cse390 0) (= .cse389 .cse2))))) (= .cse388 .cse2)))) (forall ((v_z_237 Int)) (let ((.cse392 (+ v_z_237 .cse8))) (or (< 4294967295 .cse392) (forall ((v_y_237 Int) (v_y_235 Int) (v_y_233 Int)) (let ((.cse394 (* v_y_235 4294967296)) (.cse395 (* v_y_237 4294967296))) (let ((.cse396 (+ v_z_237 .cse395 .cse9)) (.cse393 (+ .cse394 v_z_237 .cse395))) (or (< 4294967295 .cse393) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_237) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_235) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_237)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) .cse394 v_z_237 .cse395 1) 0) (< .cse396 4294967296) (< 4294967295 (+ v_z_237 .cse395)) (= .cse396 .cse1) (< .cse393 0))))) (< v_z_237 0) (= .cse392 .cse2)))) (forall ((v_z_237 Int)) (let ((.cse401 (+ v_z_237 .cse8))) (or (forall ((v_y_237 Int) (v_y_235 Int) (v_y_233 Int)) (let ((.cse398 (* v_y_235 4294967296)) (.cse399 (* v_y_237 4294967296))) (let ((.cse400 (+ v_z_237 .cse399)) (.cse397 (+ .cse398 v_z_237 .cse399))) (or (< 4294967295 .cse397) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_237) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_235) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_237)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) .cse398 v_z_237 .cse399 1) 0) (< .cse400 0) (< 4294967295 .cse400) (< .cse397 0) (= (+ v_z_237 .cse399 .cse9) .cse2))))) (< .cse401 4294967296) (= .cse401 .cse1) (< 4294967295 v_z_237)))) (forall ((v_z_237 Int)) (let ((.cse407 (+ v_z_237 .cse8))) (or (forall ((v_y_237 Int) (v_y_235 Int) (v_y_233 Int)) (let ((.cse403 (* v_y_235 4294967296)) (.cse404 (* v_y_237 4294967296))) (let ((.cse405 (+ v_z_237 .cse404)) (.cse402 (+ .cse403 v_z_237 .cse404)) (.cse406 (+ v_z_237 .cse404 .cse9))) (or (< 4294967295 .cse402) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_237) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_235) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_237)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) .cse403 v_z_237 .cse404 1) 0) (< .cse405 0) (< 4294967295 .cse405) (= .cse406 .cse1) (< .cse402 0) (= .cse406 .cse2))))) (= .cse407 .cse1) (< v_z_237 0) (< 4294967295 v_z_237) (= .cse407 .cse2)))) (forall ((v_z_237 Int)) (let ((.cse412 (+ v_z_237 .cse8))) (or (forall ((v_y_237 Int) (v_y_235 Int) (v_y_233 Int)) (let ((.cse409 (* v_y_235 4294967296)) (.cse410 (* v_y_237 4294967296))) (let ((.cse411 (+ v_z_237 .cse410 .cse9)) (.cse408 (+ .cse409 v_z_237 .cse410))) (or (< 4294967295 .cse408) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_237) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_235) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_237)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) .cse409 v_z_237 .cse410 1) 0) (< .cse411 4294967296) (< 4294967295 (+ v_z_237 .cse410)) (= .cse411 .cse1) (< .cse408 0))))) (= .cse412 .cse1) (< v_z_237 0) (< 4294967295 v_z_237) (= .cse412 .cse2)))) (forall ((v_z_237 Int)) (let ((.cse418 (+ v_z_237 .cse8))) (or (forall ((v_y_237 Int) (v_y_235 Int) (v_y_233 Int)) (let ((.cse414 (* v_y_235 4294967296)) (.cse415 (* v_y_237 4294967296))) (let ((.cse416 (+ v_z_237 .cse415)) (.cse413 (+ .cse414 v_z_237 .cse415)) (.cse417 (+ v_z_237 .cse415 .cse9))) (or (< 4294967295 .cse413) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_237) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_235) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_237)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) .cse414 v_z_237 .cse415 1) 0) (< .cse416 0) (< 4294967295 .cse416) (= .cse417 .cse1) (< .cse413 0) (= .cse417 .cse2))))) (< 4294967295 .cse418) (< v_z_237 0) (= .cse418 .cse2))))) .cse419) (forall ((v_z_189 Int) (v_y_189 Int) (v_y_187 Int)) (let ((.cse426 (* v_y_189 4294967296))) (let ((.cse421 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296)) (.cse422 (* |c_ULTIMATE.start_main_~n~0#1| v_z_189)) (.cse423 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_189) 4294967296)) (.cse420 (+ .cse426 v_z_189 .cse9)) (.cse424 (+ .cse426 v_z_189)) (.cse425 (+ v_z_189 .cse8))) (or (= .cse420 .cse2) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse421 .cse422 .cse423) 1) (< v_z_189 0) (< .cse424 0) (not (= 2 (+ .cse421 .cse422 .cse423))) (< 4294967295 .cse425) (= .cse420 .cse1) (< 4294967295 .cse424) (= .cse425 .cse2))))) (forall ((v_z_252 Int) (v_y_246 Int) (v_y_233 Int) (v_y_252 Int)) (let ((.cse428 (* v_y_252 4294967296))) (let ((.cse429 (+ v_z_252 .cse9 .cse428)) (.cse427 (+ v_z_252 (* v_y_246 4294967296) .cse428))) (or (< 4294967295 .cse427) (< 4294967295 (+ v_z_252 .cse8)) (< (+ v_z_252 .cse428) 0) (< 4294967295 .cse429) (= .cse2 .cse429) (< v_z_252 0) (not (= (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_252) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_252) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_246) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)) 2)) (< .cse427 0))))) (forall ((v_y_190 Int) (v_z_190 Int) (v_y_187 Int)) (let ((.cse431 (* v_y_190 4294967296))) (let ((.cse432 (+ v_z_190 .cse8)) (.cse430 (+ .cse431 v_z_190 .cse9)) (.cse433 (* |c_ULTIMATE.start_main_~n~0#1| v_z_190)) (.cse434 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_187) 4294967296)) (.cse435 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_190) 4294967296))) (or (= .cse430 .cse2) (< 4294967295 v_z_190) (< (+ .cse431 v_z_190) 0) (< .cse432 4294967296) (= .cse432 .cse1) (< 4294967295 .cse430) (not (= 2 (+ .cse433 .cse434 .cse435))) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse433 .cse434 .cse435) 1))))) (forall ((v_y_250 Int) (v_y_246 Int) (v_y_233 Int) (v_z_250 Int)) (let ((.cse436 (* v_y_246 4294967296)) (.cse437 (* v_y_250 4294967296))) (let ((.cse439 (+ v_z_250 .cse437 .cse9)) (.cse438 (+ v_z_250 .cse436 .cse437)) (.cse440 (+ v_z_250 .cse8))) (or (< (+ (* v_y_233 4294967296) v_z_250 .cse436 .cse437 1) 0) (< .cse438 0) (= .cse439 .cse1) (< .cse439 4294967296) (< 4294967295 .cse440) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_250) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_250) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_246) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< v_z_250 0) (< 4294967295 (+ v_z_250 .cse437)) (< 4294967295 .cse438) (= .cse440 .cse2))))) (forall ((v_z_251 Int) (v_y_251 Int) (v_y_246 Int) (v_y_233 Int)) (let ((.cse446 (* v_y_246 4294967296)) (.cse445 (* v_y_251 4294967296))) (let ((.cse442 (+ .cse445 v_z_251 .cse9)) (.cse444 (+ .cse445 v_z_251)) (.cse443 (+ .cse445 v_z_251 .cse446)) (.cse441 (+ v_z_251 .cse8))) (or (= .cse441 .cse1) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_246) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_251)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_251)))) (< 4294967295 v_z_251) (= .cse442 .cse1) (= .cse442 .cse2) (< v_z_251 0) (< .cse443 0) (< .cse444 0) (< 4294967295 .cse444) (< 4294967295 .cse443) (< (+ .cse445 (* v_y_233 4294967296) v_z_251 .cse446 1) 0) (= .cse441 .cse2))))) (or .cse17 (and (forall ((v_z_245 Int) (v_y_239 Int) (v_y_245 Int) (v_y_233 Int)) (let ((.cse452 (* v_y_239 4294967296)) (.cse451 (* v_y_245 4294967296))) (let ((.cse447 (+ v_z_245 .cse8)) (.cse449 (+ .cse451 v_z_245)) (.cse450 (+ .cse451 v_z_245 .cse9)) (.cse448 (+ .cse451 v_z_245 .cse452))) (or (= .cse447 .cse2) (< 4294967295 .cse448) (< 4294967295 .cse449) (< 4294967295 .cse447) (< .cse449 0) (not (= (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_239)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_245) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_245) 4294967296)) 2)) (= .cse450 .cse1) (< (+ (* v_y_233 4294967296) .cse451 v_z_245 .cse452 1) 0) (= .cse450 .cse2) (< v_z_245 0) (< .cse448 0))))) (forall ((v_z_242 Int) (v_y_239 Int) (v_y_233 Int) (v_y_242 Int)) (let ((.cse456 (* v_y_239 4294967296)) (.cse455 (* v_y_242 4294967296))) (let ((.cse454 (+ .cse455 v_z_242)) (.cse453 (+ v_z_242 .cse8)) (.cse457 (+ .cse455 v_z_242 .cse456))) (or (= .cse1 .cse453) (< .cse454 0) (< (+ .cse455 (* v_y_233 4294967296) v_z_242 .cse456 1) 0) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_239)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_242) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_242) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< 4294967295 .cse454) (< .cse457 0) (= (+ .cse455 v_z_242 .cse9) .cse2) (< .cse453 4294967296) (< 4294967295 .cse457) (< 4294967295 v_z_242))))) (forall ((v_z_245 Int) (v_y_239 Int) (v_y_245 Int) (v_y_233 Int)) (let ((.cse461 (* v_y_239 4294967296)) (.cse460 (* v_y_245 4294967296))) (let ((.cse459 (+ .cse460 v_z_245)) (.cse462 (+ v_z_245 .cse8)) (.cse458 (+ .cse460 v_z_245 .cse461))) (or (< 4294967295 .cse458) (< 4294967295 .cse459) (< .cse459 0) (not (= (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_239)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_245) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_245) 4294967296)) 2)) (< (+ (* v_y_233 4294967296) .cse460 v_z_245 .cse461 1) 0) (= (+ .cse460 v_z_245 .cse9) .cse2) (= .cse462 .cse1) (< .cse462 4294967296) (< .cse458 0) (< 4294967295 v_z_245))))) (forall ((v_z_244 Int) (v_y_239 Int) (v_y_233 Int) (v_y_244 Int)) (let ((.cse466 (* v_y_239 4294967296)) (.cse465 (* v_y_244 4294967296))) (let ((.cse463 (+ v_z_244 .cse465 .cse9)) (.cse464 (+ v_z_244 .cse465 .cse466)) (.cse467 (+ v_z_244 .cse8))) (or (= .cse463 .cse1) (< 4294967295 .cse464) (< .cse463 4294967296) (< .cse464 0) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_244) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_239)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_244) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) v_z_244 .cse465 .cse466 1) 0) (< 4294967295 .cse467) (= .cse2 .cse467) (< 4294967295 (+ v_z_244 .cse465)) (< v_z_244 0))))) (forall ((v_z_242 Int) (v_y_239 Int) (v_y_233 Int) (v_y_242 Int)) (let ((.cse468 (* v_y_242 4294967296))) (let ((.cse470 (+ .cse468 v_z_242 .cse9)) (.cse469 (+ .cse468 v_z_242 (* v_y_239 4294967296)))) (or (< (+ .cse468 v_z_242) 0) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_239)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_242) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_242) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< .cse469 0) (< v_z_242 0) (= .cse470 .cse2) (< 4294967295 (+ v_z_242 .cse8)) (< 4294967295 .cse470) (< 4294967295 .cse469))))) (forall ((v_z_245 Int) (v_y_239 Int) (v_y_245 Int) (v_y_233 Int)) (let ((.cse476 (* v_y_239 4294967296)) (.cse475 (* v_y_245 4294967296))) (let ((.cse473 (+ .cse475 v_z_245)) (.cse474 (+ .cse475 v_z_245 .cse9)) (.cse471 (+ v_z_245 .cse8)) (.cse472 (+ .cse475 v_z_245 .cse476))) (or (= .cse471 .cse2) (< 4294967295 .cse472) (< 4294967295 .cse473) (< .cse473 0) (not (= (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_239)) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_245) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_245) 4294967296)) 2)) (= .cse474 .cse1) (< (+ (* v_y_233 4294967296) .cse475 v_z_245 .cse476 1) 0) (= .cse474 .cse2) (= .cse471 .cse1) (< v_z_245 0) (< .cse472 0) (< 4294967295 v_z_245))))) (forall ((v_z_242 Int) (v_y_239 Int) (v_y_233 Int) (v_y_242 Int)) (let ((.cse478 (* v_y_239 4294967296)) (.cse477 (* v_y_242 4294967296))) (let ((.cse480 (+ .cse477 v_z_242 .cse9)) (.cse479 (+ .cse477 v_z_242 .cse478))) (or (= .cse1 (+ v_z_242 .cse8)) (< (+ .cse477 v_z_242) 0) (< (+ .cse477 (* v_y_233 4294967296) v_z_242 .cse478 1) 0) (not (= 2 (+ (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_239)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_242) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_242) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< .cse479 0) (< v_z_242 0) (= .cse480 .cse2) (< 4294967295 .cse480) (< 4294967295 .cse479) (< 4294967295 v_z_242))))) (forall ((v_z_244 Int) (v_y_239 Int) (v_y_233 Int) (v_y_244 Int)) (let ((.cse485 (* v_y_239 4294967296)) (.cse484 (* v_y_244 4294967296))) (let ((.cse481 (+ v_z_244 .cse484 .cse9)) (.cse483 (+ v_z_244 .cse484 .cse485)) (.cse482 (+ v_z_244 .cse8))) (or (= .cse481 .cse1) (= .cse1 .cse482) (< 4294967295 .cse483) (< .cse481 4294967296) (< .cse483 0) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_244) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_239)) (* |c_ULTIMATE.start_main_~n~0#1| v_z_244) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (< (+ (* v_y_233 4294967296) v_z_244 .cse484 .cse485 1) 0) (= .cse2 .cse482) (< 4294967295 (+ v_z_244 .cse484)) (< v_z_244 0) (< 4294967295 v_z_244))))))) (or (and (forall ((v_y_195 Int) (v_y_194 Int) (v_z_195 Int)) (let ((.cse487 (* v_y_195 4294967296))) (let ((.cse486 (+ v_z_195 .cse487 .cse9))) (or (< 4294967295 .cse486) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_195) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_195) 4294967296)) 2)) (< (+ v_z_195 .cse487) 0) (= .cse2 .cse486) (< 4294967295 (+ v_z_195 .cse8)) (< v_z_195 0))))) (forall ((v_y_195 Int) (v_y_194 Int) (v_z_195 Int)) (let ((.cse490 (* v_y_195 4294967296))) (let ((.cse488 (+ v_z_195 .cse490)) (.cse489 (+ v_z_195 .cse8))) (or (< 4294967295 v_z_195) (< 4294967295 .cse488) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_195) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_195) 4294967296)) 2)) (< .cse489 4294967296) (< .cse488 0) (< (+ v_z_195 .cse490 (* v_y_194 4294967296) 1) 0) (= .cse2 (+ v_z_195 .cse490 .cse9)) (= .cse1 .cse489))))) (forall ((v_z_194 Int)) (let ((.cse491 (+ v_z_194 .cse9))) (or (= .cse491 .cse1) (< .cse491 4294967296) (forall ((v_y_194 Int)) (let ((.cse492 (* |c_ULTIMATE.start_main_~n~0#1| v_z_194)) (.cse493 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296))) (or (< (+ v_z_194 (* v_y_194 4294967296) 1) 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse492 .cse493) 0) (not (= 2 (+ .cse492 .cse493)))))) (< 4294967295 v_z_194)))) (forall ((v_z_196 Int) (v_y_196 Int) (v_y_194 Int)) (let ((.cse494 (* v_y_196 4294967296))) (let ((.cse495 (+ .cse494 v_z_196 .cse9)) (.cse496 (+ .cse494 v_z_196)) (.cse497 (+ v_z_196 .cse8))) (or (< (+ .cse494 v_z_196 (* v_y_194 4294967296) 1) 0) (= .cse495 .cse2) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_196) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_196))) 2)) (< v_z_196 0) (< 4294967295 .cse496) (< 4294967295 .cse497) (= .cse495 .cse1) (< .cse496 0) (= .cse497 .cse2))))) (forall ((v_z_197 Int) (v_y_194 Int) (v_y_197 Int)) (let ((.cse498 (* v_y_197 4294967296))) (let ((.cse500 (+ v_z_197 .cse498 .cse9)) (.cse499 (+ v_z_197 .cse8))) (or (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_197) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_197))))) (< 4294967295 (+ v_z_197 .cse498)) (= .cse499 .cse1) (= .cse500 .cse1) (< 4294967295 v_z_197) (< .cse500 4294967296) (< (+ v_z_197 .cse498 (* v_y_194 4294967296) 1) 0) (< v_z_197 0) (= .cse499 .cse2))))) (forall ((v_z_196 Int) (v_y_196 Int) (v_y_194 Int)) (let ((.cse501 (* v_y_196 4294967296))) (let ((.cse502 (+ v_z_196 .cse8)) (.cse503 (+ .cse501 v_z_196))) (or (< (+ .cse501 v_z_196 (* v_y_194 4294967296) 1) 0) (= (+ .cse501 v_z_196 .cse9) .cse2) (= .cse502 .cse1) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_196) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_196))) 2)) (< .cse502 4294967296) (< 4294967295 .cse503) (< 4294967295 v_z_196) (< .cse503 0))))) (forall ((v_z_194 Int)) (let ((.cse504 (+ v_z_194 .cse9))) (or (= .cse504 .cse1) (= .cse504 .cse2) (forall ((v_y_194 Int)) (let ((.cse505 (* |c_ULTIMATE.start_main_~n~0#1| v_z_194)) (.cse506 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296))) (or (< (+ v_z_194 (* v_y_194 4294967296) 1) 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse505 .cse506) 0) (not (= 2 (+ .cse505 .cse506)))))) (< 4294967295 v_z_194) (< v_z_194 0)))) (forall ((v_z_197 Int) (v_y_194 Int) (v_y_197 Int)) (let ((.cse508 (* v_y_197 4294967296))) (let ((.cse509 (+ v_z_197 .cse508 .cse9)) (.cse507 (+ v_z_197 .cse8))) (or (< 4294967295 .cse507) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_197) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_197))))) (< 4294967295 (+ v_z_197 .cse508)) (= .cse509 .cse1) (< .cse509 4294967296) (< (+ v_z_197 .cse508 (* v_y_194 4294967296) 1) 0) (< v_z_197 0) (= .cse507 .cse2))))) (forall ((v_z_196 Int) (v_y_196 Int) (v_y_194 Int)) (let ((.cse510 (* v_y_196 4294967296))) (let ((.cse511 (+ .cse510 v_z_196 .cse9)) (.cse513 (+ .cse510 v_z_196)) (.cse512 (+ v_z_196 .cse8))) (or (< (+ .cse510 v_z_196 (* v_y_194 4294967296) 1) 0) (= .cse511 .cse2) (= .cse512 .cse1) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_196) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296) (* 4294967296 (* |c_ULTIMATE.start_main_~n~0#1| v_y_196))) 2)) (< v_z_196 0) (< 4294967295 .cse513) (< 4294967295 v_z_196) (= .cse511 .cse1) (< .cse513 0) (= .cse512 .cse2))))) (or (and (forall ((v_z_200 Int)) (let ((.cse514 (+ v_z_200 .cse9))) (or (< v_z_200 0) (< 4294967295 .cse514) (= .cse514 .cse2) (forall ((v_y_200 Int)) (let ((.cse516 (* |c_ULTIMATE.start_main_~n~0#1| v_z_200)) (.cse517 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296))) (let ((.cse515 (+ |c_ULTIMATE.start_main_~n~0#1| .cse516 .cse517))) (or (= .cse515 1) (not (= 2 (+ .cse516 .cse517))) (= .cse515 0)))))))) (forall ((v_z_203 Int) (v_y_203 Int) (v_y_200 Int)) (let ((.cse524 (* v_y_203 4294967296))) (let ((.cse518 (+ v_z_203 .cse8)) (.cse519 (+ .cse524 v_z_203 .cse9)) (.cse521 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_203) 4294967296)) (.cse522 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296)) (.cse523 (* |c_ULTIMATE.start_main_~n~0#1| v_z_203)) (.cse520 (+ .cse524 v_z_203))) (or (= .cse2 .cse518) (< v_z_203 0) (= .cse519 .cse2) (< 4294967295 .cse518) (= .cse519 .cse1) (< .cse520 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse521 .cse522 .cse523) 1) (not (= 2 (+ .cse521 .cse522 .cse523))) (< 4294967295 .cse520))))) (forall ((v_z_203 Int) (v_y_203 Int) (v_y_200 Int)) (let ((.cse525 (* v_y_203 4294967296))) (let ((.cse527 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_203) 4294967296)) (.cse528 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296)) (.cse529 (* |c_ULTIMATE.start_main_~n~0#1| v_z_203)) (.cse526 (+ .cse525 v_z_203)) (.cse530 (+ v_z_203 .cse8))) (or (= (+ .cse525 v_z_203 .cse9) .cse2) (< .cse526 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse527 .cse528 .cse529) 1) (< .cse530 4294967296) (not (= 2 (+ .cse527 .cse528 .cse529))) (< 4294967295 .cse526) (< 4294967295 v_z_203) (= .cse1 .cse530))))) (forall ((v_z_201 Int) (v_y_201 Int) (v_y_200 Int)) (let ((.cse532 (* v_y_201 4294967296))) (let ((.cse531 (+ .cse532 v_z_201 .cse9))) (or (< 4294967295 (+ v_z_201 .cse8)) (< v_z_201 0) (not (= 2 (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_201) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_201)))) (< 4294967295 .cse531) (< (+ .cse532 v_z_201) 0) (= .cse2 .cse531))))) (forall ((v_z_200 Int)) (let ((.cse533 (+ v_z_200 .cse9))) (or (< 4294967295 v_z_200) (= .cse533 .cse1) (< .cse533 4294967296) (forall ((v_y_200 Int)) (let ((.cse535 (* |c_ULTIMATE.start_main_~n~0#1| v_z_200)) (.cse536 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296))) (let ((.cse534 (+ |c_ULTIMATE.start_main_~n~0#1| .cse535 .cse536))) (or (= .cse534 1) (not (= 2 (+ .cse535 .cse536))) (= .cse534 0)))))))) (forall ((v_z_202 Int) (v_y_202 Int) (v_y_200 Int)) (let ((.cse537 (* v_y_202 4294967296))) (let ((.cse541 (+ v_z_202 .cse8)) (.cse538 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296)) (.cse539 (* |c_ULTIMATE.start_main_~n~0#1| v_z_202)) (.cse540 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_202) 4294967296)) (.cse542 (+ v_z_202 .cse537 .cse9))) (or (< 4294967295 (+ v_z_202 .cse537)) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse538 .cse539 .cse540) 1) (= .cse541 .cse2) (< 4294967295 .cse541) (< .cse542 4294967296) (< v_z_202 0) (not (= 2 (+ .cse538 .cse539 .cse540))) (= .cse542 .cse1))))) (forall ((v_z_202 Int) (v_y_202 Int) (v_y_200 Int)) (let ((.cse543 (* v_y_202 4294967296))) (let ((.cse544 (+ v_z_202 .cse8)) (.cse545 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296)) (.cse546 (* |c_ULTIMATE.start_main_~n~0#1| v_z_202)) (.cse547 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_202) 4294967296)) (.cse548 (+ v_z_202 .cse543 .cse9))) (or (< 4294967295 (+ v_z_202 .cse543)) (= .cse544 .cse1) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse545 .cse546 .cse547) 1) (= .cse544 .cse2) (< 4294967295 v_z_202) (< .cse548 4294967296) (< v_z_202 0) (not (= 2 (+ .cse545 .cse546 .cse547))) (= .cse548 .cse1))))) (forall ((v_z_200 Int)) (let ((.cse549 (+ v_z_200 .cse9))) (or (< 4294967295 v_z_200) (< v_z_200 0) (= .cse549 .cse2) (= .cse549 .cse1) (forall ((v_y_200 Int)) (let ((.cse551 (* |c_ULTIMATE.start_main_~n~0#1| v_z_200)) (.cse552 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296))) (let ((.cse550 (+ |c_ULTIMATE.start_main_~n~0#1| .cse551 .cse552))) (or (= .cse550 1) (not (= 2 (+ .cse551 .cse552))) (= .cse550 0)))))))) (forall ((v_z_203 Int) (v_y_203 Int) (v_y_200 Int)) (let ((.cse559 (* v_y_203 4294967296))) (let ((.cse554 (+ .cse559 v_z_203 .cse9)) (.cse556 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_203) 4294967296)) (.cse557 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296)) (.cse558 (* |c_ULTIMATE.start_main_~n~0#1| v_z_203)) (.cse555 (+ .cse559 v_z_203)) (.cse553 (+ v_z_203 .cse8))) (or (= .cse2 .cse553) (< v_z_203 0) (= .cse554 .cse2) (= .cse554 .cse1) (< .cse555 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse556 .cse557 .cse558) 1) (not (= 2 (+ .cse556 .cse557 .cse558))) (< 4294967295 .cse555) (< 4294967295 v_z_203) (= .cse1 .cse553))))) (forall ((v_z_201 Int) (v_y_201 Int) (v_y_200 Int)) (let ((.cse565 (* v_y_201 4294967296))) (let ((.cse563 (+ v_z_201 .cse8)) (.cse560 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296)) (.cse561 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_201) 4294967296)) (.cse562 (* |c_ULTIMATE.start_main_~n~0#1| v_z_201)) (.cse564 (+ .cse565 v_z_201))) (or (< 4294967295 v_z_201) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse560 .cse561 .cse562) 1) (< .cse563 4294967296) (= .cse563 .cse1) (not (= 2 (+ .cse560 .cse561 .cse562))) (< .cse564 0) (< 4294967295 .cse564) (= .cse2 (+ .cse565 v_z_201 .cse9)))))) (forall ((v_z_201 Int) (v_y_201 Int) (v_y_200 Int)) (let ((.cse570 (* v_y_201 4294967296))) (let ((.cse566 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_200) 4294967296)) (.cse567 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_201) 4294967296)) (.cse568 (* |c_ULTIMATE.start_main_~n~0#1| v_z_201)) (.cse569 (+ .cse570 v_z_201 .cse9))) (or (< 4294967295 v_z_201) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse566 .cse567 .cse568) 1) (= (+ v_z_201 .cse8) .cse1) (< v_z_201 0) (not (= 2 (+ .cse566 .cse567 .cse568))) (< 4294967295 .cse569) (< (+ .cse570 v_z_201) 0) (= .cse2 .cse569)))))) .cse214) (forall ((v_z_194 Int)) (let ((.cse571 (+ v_z_194 .cse9))) (or (= .cse571 .cse2) (forall ((v_y_194 Int)) (let ((.cse572 (* |c_ULTIMATE.start_main_~n~0#1| v_z_194)) (.cse573 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296))) (or (< (+ v_z_194 (* v_y_194 4294967296) 1) 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse572 .cse573) 0) (not (= 2 (+ .cse572 .cse573)))))) (< 4294967295 .cse571) (< v_z_194 0)))) (forall ((v_y_195 Int) (v_y_194 Int) (v_z_195 Int)) (let ((.cse575 (* v_y_195 4294967296))) (let ((.cse574 (+ v_z_195 .cse575 .cse9))) (or (< 4294967295 .cse574) (< 4294967295 v_z_195) (not (= (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_195) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_194) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_195) 4294967296)) 2)) (< (+ v_z_195 .cse575) 0) (< (+ v_z_195 .cse575 (* v_y_194 4294967296) 1) 0) (= .cse2 .cse574) (= .cse1 (+ v_z_195 .cse8)) (< v_z_195 0)))))) .cse17) (forall ((v_y_250 Int) (v_y_246 Int) (v_y_233 Int) (v_z_250 Int)) (let ((.cse576 (* v_y_246 4294967296)) (.cse577 (* v_y_250 4294967296))) (let ((.cse579 (+ v_z_250 .cse577 .cse9)) (.cse578 (+ v_z_250 .cse576 .cse577)) (.cse580 (+ v_z_250 .cse8))) (or (< (+ (* v_y_233 4294967296) v_z_250 .cse576 .cse577 1) 0) (< .cse578 0) (= .cse579 .cse1) (< .cse579 4294967296) (not (= 2 (+ (* |c_ULTIMATE.start_main_~n~0#1| v_z_250) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_250) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_246) 4294967296) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_233) 4294967296)))) (= .cse580 .cse1) (< v_z_250 0) (< 4294967295 (+ v_z_250 .cse577)) (< 4294967295 v_z_250) (< 4294967295 .cse578) (= .cse580 .cse2))))) (or .cse419 (and (forall ((v_y_184 Int) (v_y_182 Int) (v_z_184 Int)) (let ((.cse587 (* v_y_184 4294967296))) (let ((.cse584 (+ v_z_184 .cse8)) (.cse585 (+ v_z_184 .cse587)) (.cse581 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse582 (* |c_ULTIMATE.start_main_~n~0#1| v_z_184)) (.cse583 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_184) 4294967296)) (.cse586 (+ v_z_184 .cse9 .cse587))) (or (not (= (+ .cse581 .cse582 .cse583) 2)) (= .cse584 .cse1) (< 4294967295 v_z_184) (= .cse584 .cse2) (< v_z_184 0) (< 4294967295 .cse585) (= .cse586 .cse2) (< .cse585 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse581 .cse582 .cse583) 1) (= .cse586 .cse1))))) (forall ((v_z_182 Int)) (let ((.cse591 (+ v_z_182 .cse9))) (or (forall ((v_y_182 Int)) (let ((.cse589 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse590 (* |c_ULTIMATE.start_main_~n~0#1| v_z_182))) (let ((.cse588 (+ |c_ULTIMATE.start_main_~n~0#1| .cse589 .cse590))) (or (= .cse588 1) (= .cse588 0) (not (= 2 (+ .cse589 .cse590))))))) (< 4294967295 .cse591) (< v_z_182 0) (= .cse591 .cse2)))) (forall ((v_y_184 Int) (v_y_182 Int) (v_z_184 Int)) (let ((.cse598 (* v_y_184 4294967296))) (let ((.cse596 (+ v_z_184 .cse598)) (.cse595 (+ v_z_184 .cse8)) (.cse592 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse593 (* |c_ULTIMATE.start_main_~n~0#1| v_z_184)) (.cse594 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_184) 4294967296)) (.cse597 (+ v_z_184 .cse9 .cse598))) (or (not (= (+ .cse592 .cse593 .cse594) 2)) (= .cse595 .cse2) (< v_z_184 0) (< 4294967295 .cse596) (= .cse597 .cse2) (< .cse596 0) (< 4294967295 .cse595) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse592 .cse593 .cse594) 1) (= .cse597 .cse1))))) (forall ((v_z_185 Int) (v_y_185 Int) (v_y_182 Int)) (let ((.cse599 (* v_y_185 4294967296))) (let ((.cse601 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse602 (* |c_ULTIMATE.start_main_~n~0#1| v_z_185)) (.cse603 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_185) 4294967296)) (.cse600 (+ v_z_185 .cse8)) (.cse604 (+ v_z_185 .cse599))) (or (< 4294967295 v_z_185) (= (+ v_z_185 .cse9 .cse599) .cse2) (= .cse1 .cse600) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse601 .cse602 .cse603) 1) (not (= (+ .cse601 .cse602 .cse603) 2)) (< .cse604 0) (< .cse600 4294967296) (< 4294967295 .cse604))))) (forall ((v_z_185 Int) (v_y_185 Int) (v_y_182 Int)) (let ((.cse609 (* v_y_185 4294967296))) (let ((.cse605 (+ v_z_185 .cse9 .cse609)) (.cse606 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse607 (* |c_ULTIMATE.start_main_~n~0#1| v_z_185)) (.cse608 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_185) 4294967296))) (or (< 4294967295 v_z_185) (< 4294967295 .cse605) (= .cse605 .cse2) (< v_z_185 0) (= .cse1 (+ v_z_185 .cse8)) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse606 .cse607 .cse608) 1) (not (= (+ .cse606 .cse607 .cse608) 2)) (< (+ v_z_185 .cse609) 0))))) (forall ((v_z_182 Int)) (let ((.cse610 (+ v_z_182 .cse9))) (or (< .cse610 4294967296) (< 4294967295 v_z_182) (forall ((v_y_182 Int)) (let ((.cse612 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse613 (* |c_ULTIMATE.start_main_~n~0#1| v_z_182))) (let ((.cse611 (+ |c_ULTIMATE.start_main_~n~0#1| .cse612 .cse613))) (or (= .cse611 1) (= .cse611 0) (not (= 2 (+ .cse612 .cse613))))))) (= .cse610 .cse1)))) (forall ((v_z_182 Int)) (let ((.cse617 (+ v_z_182 .cse9))) (or (< 4294967295 v_z_182) (forall ((v_y_182 Int)) (let ((.cse615 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse616 (* |c_ULTIMATE.start_main_~n~0#1| v_z_182))) (let ((.cse614 (+ |c_ULTIMATE.start_main_~n~0#1| .cse615 .cse616))) (or (= .cse614 1) (= .cse614 0) (not (= 2 (+ .cse615 .cse616))))))) (= .cse617 .cse1) (< v_z_182 0) (= .cse617 .cse2)))) (forall ((v_y_182 Int) (v_y_183 Int) (v_z_183 Int)) (let ((.cse621 (* v_y_183 4294967296))) (let ((.cse622 (+ v_z_183 .cse9 .cse621)) (.cse623 (+ v_z_183 .cse8)) (.cse618 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse619 (* |c_ULTIMATE.start_main_~n~0#1| v_z_183)) (.cse620 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_183) 4294967296))) (or (not (= (+ .cse618 .cse619 .cse620) 2)) (< 4294967295 (+ v_z_183 .cse621)) (= .cse622 .cse1) (= .cse2 .cse623) (< v_z_183 0) (< .cse622 4294967296) (< 4294967295 .cse623) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse618 .cse619 .cse620) 1))))) (forall ((v_y_184 Int) (v_y_182 Int) (v_z_184 Int)) (let ((.cse629 (* v_y_184 4294967296))) (let ((.cse624 (+ v_z_184 .cse8)) (.cse628 (+ v_z_184 .cse629)) (.cse625 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse626 (* |c_ULTIMATE.start_main_~n~0#1| v_z_184)) (.cse627 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_184) 4294967296))) (or (< .cse624 4294967296) (not (= (+ .cse625 .cse626 .cse627) 2)) (= .cse624 .cse1) (< 4294967295 v_z_184) (< 4294967295 .cse628) (= (+ v_z_184 .cse9 .cse629) .cse2) (< .cse628 0) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse625 .cse626 .cse627) 1))))) (forall ((v_z_185 Int) (v_y_185 Int) (v_y_182 Int)) (let ((.cse631 (* v_y_185 4294967296))) (let ((.cse630 (+ v_z_185 .cse9 .cse631))) (or (< 4294967295 .cse630) (= .cse630 .cse2) (< v_z_185 0) (not (= (+ (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_185) (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_185) 4294967296)) 2)) (< (+ v_z_185 .cse631) 0) (< 4294967295 (+ v_z_185 .cse8)))))) (forall ((v_y_182 Int) (v_y_183 Int) (v_z_183 Int)) (let ((.cse635 (* v_y_183 4294967296))) (let ((.cse637 (+ v_z_183 .cse8)) (.cse636 (+ v_z_183 .cse9 .cse635)) (.cse632 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_182) 4294967296)) (.cse633 (* |c_ULTIMATE.start_main_~n~0#1| v_z_183)) (.cse634 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_183) 4294967296))) (or (not (= (+ .cse632 .cse633 .cse634) 2)) (< 4294967295 (+ v_z_183 .cse635)) (= .cse636 .cse1) (= .cse2 .cse637) (= .cse1 .cse637) (< v_z_183 0) (< 4294967295 v_z_183) (< .cse636 4294967296) (= (+ |c_ULTIMATE.start_main_~n~0#1| .cse632 .cse633 .cse634) 1))))))) (forall ((v_z_179 Int) (v_y_179 Int)) (let ((.cse638 (* |c_ULTIMATE.start_main_~n~0#1| v_z_179)) (.cse639 (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_179) 4294967296))) (or (not (= (+ .cse638 .cse639) 0)) (< v_z_179 0) (not (= 2 (+ |c_ULTIMATE.start_main_~n~0#1| .cse638 .cse639))) (< 4294967295 v_z_179)))) (forall ((v_y_180 Int) (v_z_180 Int)) (let ((.cse640 (+ v_z_180 .cse8))) (or (not (= (+ |c_ULTIMATE.start_main_~n~0#1| (* (* |c_ULTIMATE.start_main_~n~0#1| v_y_180) 4294967296) (* |c_ULTIMATE.start_main_~n~0#1| v_z_180)) 0)) (= .cse2 .cse640) (< 4294967295 v_z_180) (< v_z_180 0) (< (+ (* v_y_180 4294967296) v_z_180 1) 0) (= .cse1 .cse640)))))))) is different from false [2024-11-28 04:13:52,378 WARN L286 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)