./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i --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_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/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_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/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_5a176555-fd8a-45dc-ad23-d67071d6186b/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 c0b4e00ed6b48bb07fe90a496ec4ca5231949ecbe9421f0d7744d947fc9f4864 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:29:14,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:29:14,367 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:29:14,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:29:14,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:29:14,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:29:14,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:29:14,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:29:14,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:29:14,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:29:14,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:29:14,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:29:14,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:29:14,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:29:14,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:29:14,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:29:14,424 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:29:14,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:29:14,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:29:14,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:14,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:14,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:14,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:14,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:29:14,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:14,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:14,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:14,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:14,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:29:14,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:29:14,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:29:14,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:29:14,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:29:14,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:29:14,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:29:14,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:29:14,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:29:14,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:29:14,428 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_5a176555-fd8a-45dc-ad23-d67071d6186b/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 -> c0b4e00ed6b48bb07fe90a496ec4ca5231949ecbe9421f0d7744d947fc9f4864 [2024-11-28 03:29:14,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:29:14,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:29:14,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:29:14,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:29:14,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:29:14,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i [2024-11-28 03:29:18,100 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data/e127a6745/e5eb737b829544bd871cbd112b469610/FLAG8a5d54027 [2024-11-28 03:29:18,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:29:18,481 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i [2024-11-28 03:29:18,492 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data/e127a6745/e5eb737b829544bd871cbd112b469610/FLAG8a5d54027 [2024-11-28 03:29:18,678 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data/e127a6745/e5eb737b829544bd871cbd112b469610 [2024-11-28 03:29:18,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:29:18,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:29:18,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:18,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:29:18,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:29:18,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:18" (1/1) ... [2024-11-28 03:29:18,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574d225f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:18, skipping insertion in model container [2024-11-28 03:29:18,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:18" (1/1) ... [2024-11-28 03:29:18,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:18,940 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_5a176555-fd8a-45dc-ad23-d67071d6186b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i[916,929] [2024-11-28 03:29:19,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:19,024 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:29:19,036 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_5a176555-fd8a-45dc-ad23-d67071d6186b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i[916,929] [2024-11-28 03:29:19,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:19,105 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:29:19,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19 WrapperNode [2024-11-28 03:29:19,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:19,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:19,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:29:19,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:29:19,115 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:29:19" (1/1) ... [2024-11-28 03:29:19,128 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:29:19" (1/1) ... [2024-11-28 03:29:19,169 INFO L138 Inliner]: procedures = 29, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2024-11-28 03:29:19,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:19,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:29:19,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:29:19,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:29:19,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,214 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 8, 11, 17, 21, 16, 56]. 43 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 2, 2, 1, 7]. The 18 writes are split as follows [0, 1, 1, 2, 2, 3, 9]. [2024-11-28 03:29:19,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:29:19,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:29:19,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:29:19,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:29:19,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (1/1) ... [2024-11-28 03:29:19,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:19,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:19,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/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:29:19,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/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:29:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:29:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:29:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:29:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:29:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-28 03:29:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-28 03:29:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-28 03:29:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-28 03:29:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-28 03:29:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-28 03:29:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-28 03:29:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-28 03:29:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-28 03:29:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-28 03:29:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-28 03:29:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-28 03:29:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-28 03:29:19,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-28 03:29:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-28 03:29:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-28 03:29:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-28 03:29:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-28 03:29:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:29:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:29:19,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:29:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-28 03:29:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-28 03:29:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-28 03:29:19,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-28 03:29:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-28 03:29:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-28 03:29:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-28 03:29:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-28 03:29:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-28 03:29:19,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-28 03:29:19,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-28 03:29:19,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:29:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:29:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:29:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:29:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:29:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-28 03:29:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-28 03:29:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-28 03:29:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-28 03:29:19,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:29:19,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:29:19,651 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:29:19,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:29:20,331 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-28 03:29:20,332 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:29:20,394 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:29:20,394 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:29:20,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:20 BoogieIcfgContainer [2024-11-28 03:29:20,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:29:20,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:29:20,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:29:20,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:29:20,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:29:18" (1/3) ... [2024-11-28 03:29:20,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260c7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:20, skipping insertion in model container [2024-11-28 03:29:20,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:19" (2/3) ... [2024-11-28 03:29:20,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260c7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:29:20, skipping insertion in model container [2024-11-28 03:29:20,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:20" (3/3) ... [2024-11-28 03:29:20,414 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-75.i [2024-11-28 03:29:20,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:29:20,440 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-75.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:29:20,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:29:20,542 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;@54802d47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:29:20,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:29:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:29:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:29:20,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:20,565 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:20,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:20,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1312223039, now seen corresponding path program 1 times [2024-11-28 03:29:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:20,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66861925] [2024-11-28 03:29:20,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:20,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-28 03:29:21,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:21,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66861925] [2024-11-28 03:29:21,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66861925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:29:21,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921337126] [2024-11-28 03:29:21,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:21,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:21,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:21,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:21,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:29:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:21,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:29:21,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-28 03:29:21,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:29:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921337126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:29:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 03:29:21,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643299010] [2024-11-28 03:29:21,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:21,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:29:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:21,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:29:21,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:29:21,481 INFO L87 Difference]: Start difference. First operand has 97 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:29:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:21,530 INFO L93 Difference]: Finished difference Result 187 states and 295 transitions. [2024-11-28 03:29:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:29:21,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-11-28 03:29:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:21,542 INFO L225 Difference]: With dead ends: 187 [2024-11-28 03:29:21,542 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 03:29:21,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:29:21,551 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:21,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 03:29:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 03:29:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:29:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-28 03:29:21,599 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 136 [2024-11-28 03:29:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:21,599 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-28 03:29:21,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:29:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-28 03:29:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:29:21,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:21,604 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:21,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:29:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-28 03:29:21,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:21,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:21,807 INFO L85 PathProgramCache]: Analyzing trace with hash 713516633, now seen corresponding path program 1 times [2024-11-28 03:29:21,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:21,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462275393] [2024-11-28 03:29:21,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:22,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462275393] [2024-11-28 03:29:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462275393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:22,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:22,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:29:22,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923068077] [2024-11-28 03:29:22,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:22,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:22,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:22,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:22,286 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:29:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:22,339 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2024-11-28 03:29:22,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:22,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-11-28 03:29:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:22,341 INFO L225 Difference]: With dead ends: 185 [2024-11-28 03:29:22,341 INFO L226 Difference]: Without dead ends: 95 [2024-11-28 03:29:22,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:22,343 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:22,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-28 03:29:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-28 03:29:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:29:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-28 03:29:22,357 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2024-11-28 03:29:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:22,358 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-28 03:29:22,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:29:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-28 03:29:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:29:22,362 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:22,363 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:22,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:29:22,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:22,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1995688919, now seen corresponding path program 1 times [2024-11-28 03:29:22,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:22,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534856708] [2024-11-28 03:29:22,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:22,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534856708] [2024-11-28 03:29:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534856708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:22,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:22,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:29:22,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252386710] [2024-11-28 03:29:22,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:22,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:22,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:22,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:22,769 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:29:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:22,835 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-11-28 03:29:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:22,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-28 03:29:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:22,841 INFO L225 Difference]: With dead ends: 190 [2024-11-28 03:29:22,841 INFO L226 Difference]: Without dead ends: 98 [2024-11-28 03:29:22,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:22,843 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:22,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-28 03:29:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-28 03:29:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:29:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-28 03:29:22,866 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 136 [2024-11-28 03:29:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:22,867 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-28 03:29:22,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:29:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-28 03:29:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:29:22,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:22,874 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:22,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:29:22,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:22,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash -524271015, now seen corresponding path program 1 times [2024-11-28 03:29:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154698857] [2024-11-28 03:29:22,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:23,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:23,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154698857] [2024-11-28 03:29:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154698857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:23,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:29:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124809905] [2024-11-28 03:29:23,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:23,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:29:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:23,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:29:23,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:23,219 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:29:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:23,276 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-28 03:29:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:29:23,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-28 03:29:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:23,282 INFO L225 Difference]: With dead ends: 194 [2024-11-28 03:29:23,282 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 03:29:23,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:29:23,284 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:23,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:29:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 03:29:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-28 03:29:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:29:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-28 03:29:23,305 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2024-11-28 03:29:23,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:23,308 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-28 03:29:23,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:29:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-28 03:29:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:29:23,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:23,314 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:23,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:29:23,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:23,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash -522423973, now seen corresponding path program 1 times [2024-11-28 03:29:23,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:23,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360647247] [2024-11-28 03:29:23,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:26,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:26,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360647247] [2024-11-28 03:29:26,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360647247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:26,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:26,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:29:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841646759] [2024-11-28 03:29:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:26,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:29:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:26,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:29:26,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:29:26,908 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-28 03:29:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:29,090 INFO L93 Difference]: Finished difference Result 500 states and 704 transitions. [2024-11-28 03:29:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 03:29:29,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2024-11-28 03:29:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:29,105 INFO L225 Difference]: With dead ends: 500 [2024-11-28 03:29:29,107 INFO L226 Difference]: Without dead ends: 404 [2024-11-28 03:29:29,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2024-11-28 03:29:29,110 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 624 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:29,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1098 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 03:29:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-28 03:29:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 393. [2024-11-28 03:29:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 319 states have (on average 1.335423197492163) internal successors, (426), 322 states have internal predecessors, (426), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-28 03:29:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 556 transitions. [2024-11-28 03:29:29,229 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 556 transitions. Word has length 136 [2024-11-28 03:29:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:29,231 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 556 transitions. [2024-11-28 03:29:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-28 03:29:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 556 transitions. [2024-11-28 03:29:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:29:29,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:29,236 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:29,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:29:29,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:29,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1340072423, now seen corresponding path program 1 times [2024-11-28 03:29:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:29,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902995119] [2024-11-28 03:29:29,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:29,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:29,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902995119] [2024-11-28 03:29:29,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902995119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:29,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:29,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:29:29,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388949163] [2024-11-28 03:29:29,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:29,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:29:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:29,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:29:29,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:29:29,557 INFO L87 Difference]: Start difference. First operand 393 states and 556 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:29:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:29,931 INFO L93 Difference]: Finished difference Result 968 states and 1369 transitions. [2024-11-28 03:29:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:29,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-28 03:29:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:29,940 INFO L225 Difference]: With dead ends: 968 [2024-11-28 03:29:29,941 INFO L226 Difference]: Without dead ends: 601 [2024-11-28 03:29:29,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:29:29,944 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 119 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:29,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 719 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:29:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-28 03:29:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 413. [2024-11-28 03:29:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 339 states have (on average 1.3421828908554572) internal successors, (455), 342 states have internal predecessors, (455), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-28 03:29:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 585 transitions. [2024-11-28 03:29:30,044 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 585 transitions. Word has length 136 [2024-11-28 03:29:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:30,045 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 585 transitions. [2024-11-28 03:29:30,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:29:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 585 transitions. [2024-11-28 03:29:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:29:30,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:30,048 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:30,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:29:30,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:30,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1943777623, now seen corresponding path program 1 times [2024-11-28 03:29:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330602536] [2024-11-28 03:29:30,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:31,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:31,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330602536] [2024-11-28 03:29:31,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330602536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:31,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:31,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:29:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438048408] [2024-11-28 03:29:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:31,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:31,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:31,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:31,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:31,407 INFO L87 Difference]: Start difference. First operand 413 states and 585 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:29:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:31,690 INFO L93 Difference]: Finished difference Result 808 states and 1139 transitions. [2024-11-28 03:29:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:29:31,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-11-28 03:29:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:31,695 INFO L225 Difference]: With dead ends: 808 [2024-11-28 03:29:31,695 INFO L226 Difference]: Without dead ends: 421 [2024-11-28 03:29:31,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:29:31,697 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 91 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:31,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 441 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-28 03:29:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-28 03:29:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2024-11-28 03:29:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 269 states have (on average 1.338289962825279) internal successors, (360), 271 states have internal predecessors, (360), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-28 03:29:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 456 transitions. [2024-11-28 03:29:31,758 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 456 transitions. Word has length 136 [2024-11-28 03:29:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:31,759 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 456 transitions. [2024-11-28 03:29:31,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:29:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 456 transitions. [2024-11-28 03:29:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-28 03:29:31,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:31,762 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:31,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:29:31,762 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:31,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -92086922, now seen corresponding path program 1 times [2024-11-28 03:29:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490976873] [2024-11-28 03:29:31,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490976873] [2024-11-28 03:29:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490976873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:34,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:34,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-28 03:29:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465214727] [2024-11-28 03:29:34,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:34,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:29:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:34,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:29:34,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:29:34,497 INFO L87 Difference]: Start difference. First operand 325 states and 456 transitions. Second operand has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-28 03:29:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:35,914 INFO L93 Difference]: Finished difference Result 717 states and 1001 transitions. [2024-11-28 03:29:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-28 03:29:35,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) Word has length 138 [2024-11-28 03:29:35,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:35,918 INFO L225 Difference]: With dead ends: 717 [2024-11-28 03:29:35,919 INFO L226 Difference]: Without dead ends: 418 [2024-11-28 03:29:35,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2024-11-28 03:29:35,921 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 356 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:35,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1006 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 03:29:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-28 03:29:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 360. [2024-11-28 03:29:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 304 states have (on average 1.3453947368421053) internal successors, (409), 306 states have internal predecessors, (409), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-28 03:29:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 505 transitions. [2024-11-28 03:29:35,989 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 505 transitions. Word has length 138 [2024-11-28 03:29:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:35,989 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 505 transitions. [2024-11-28 03:29:35,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.090909090909091) internal successors, (56), 13 states have internal predecessors, (56), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-28 03:29:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 505 transitions. [2024-11-28 03:29:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-28 03:29:35,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:35,992 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:35,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:29:35,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:35,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:35,993 INFO L85 PathProgramCache]: Analyzing trace with hash -335769919, now seen corresponding path program 1 times [2024-11-28 03:29:35,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:35,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682946021] [2024-11-28 03:29:35,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:35,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682946021] [2024-11-28 03:29:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682946021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:36,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:29:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986491426] [2024-11-28 03:29:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:29:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:36,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:29:36,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:29:36,548 INFO L87 Difference]: Start difference. First operand 360 states and 505 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:29:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:37,062 INFO L93 Difference]: Finished difference Result 774 states and 1077 transitions. [2024-11-28 03:29:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:29:37,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-28 03:29:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:37,066 INFO L225 Difference]: With dead ends: 774 [2024-11-28 03:29:37,067 INFO L226 Difference]: Without dead ends: 440 [2024-11-28 03:29:37,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:29:37,069 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 281 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:37,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 529 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:29:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-28 03:29:37,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 351. [2024-11-28 03:29:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 295 states have (on average 1.3322033898305086) internal successors, (393), 297 states have internal predecessors, (393), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-28 03:29:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 489 transitions. [2024-11-28 03:29:37,141 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 489 transitions. Word has length 139 [2024-11-28 03:29:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:37,142 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 489 transitions. [2024-11-28 03:29:37,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:29:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 489 transitions. [2024-11-28 03:29:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-28 03:29:37,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:37,146 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:37,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:29:37,146 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:37,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:37,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1137983555, now seen corresponding path program 1 times [2024-11-28 03:29:37,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:37,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7022510] [2024-11-28 03:29:37,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:37,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:29:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480462370] [2024-11-28 03:29:37,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:37,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:37,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:37,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:37,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:29:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:29:37,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 03:29:37,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:37,754 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 19 treesize of output 1 [2024-11-28 03:29:37,779 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 17 treesize of output 17 [2024-11-28 03:29:37,797 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:29:37,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:29:37,997 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 28 treesize of output 10 [2024-11-28 03:29:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:29:38,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:29:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:29:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7022510] [2024-11-28 03:29:38,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-28 03:29:38,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480462370] [2024-11-28 03:29:38,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480462370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:29:38,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:29:38,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:29:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348110690] [2024-11-28 03:29:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:29:38,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:29:38,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:29:38,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:29:38,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:29:38,070 INFO L87 Difference]: Start difference. First operand 351 states and 489 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:29:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:38,522 INFO L93 Difference]: Finished difference Result 801 states and 1107 transitions. [2024-11-28 03:29:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:29:38,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-28 03:29:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:38,526 INFO L225 Difference]: With dead ends: 801 [2024-11-28 03:29:38,526 INFO L226 Difference]: Without dead ends: 476 [2024-11-28 03:29:38,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:29:38,532 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 291 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:38,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1022 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:29:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-28 03:29:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 364. [2024-11-28 03:29:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 307 states have (on average 1.3322475570032573) internal successors, (409), 309 states have internal predecessors, (409), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-28 03:29:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 505 transitions. [2024-11-28 03:29:38,595 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 505 transitions. Word has length 139 [2024-11-28 03:29:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:38,596 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 505 transitions. [2024-11-28 03:29:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:29:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 505 transitions. [2024-11-28 03:29:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-28 03:29:38,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:38,603 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:38,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-28 03:29:38,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:29:38,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:38,806 INFO L85 PathProgramCache]: Analyzing trace with hash 141880123, now seen corresponding path program 1 times [2024-11-28 03:29:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:29:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518346390] [2024-11-28 03:29:38,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:29:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-28 03:29:38,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1856881720] [2024-11-28 03:29:38,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:29:38,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:38,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:38,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:38,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:29:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:29:39,458 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:29:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:29:40,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:29:40,031 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:29:40,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:29:40,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:29:40,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-28 03:29:40,238 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:40,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:29:40,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:29:40 BoogieIcfgContainer [2024-11-28 03:29:40,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:29:40,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:29:40,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:29:40,397 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:29:40,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:29:20" (3/4) ... [2024-11-28 03:29:40,401 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:29:40,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:29:40,403 INFO L158 Benchmark]: Toolchain (without parser) took 21720.20ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 91.9MB in the beginning and 284.8MB in the end (delta: -192.9MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-11-28 03:29:40,403 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:40,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.51ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 76.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:29:40,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.35ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 73.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:40,404 INFO L158 Benchmark]: Boogie Preprocessor took 134.70ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 68.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:29:40,404 INFO L158 Benchmark]: RCFGBuilder took 1089.43ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 89.8MB in the end (delta: -21.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-28 03:29:40,404 INFO L158 Benchmark]: TraceAbstraction took 19991.56ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 89.3MB in the beginning and 284.8MB in the end (delta: -195.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-28 03:29:40,405 INFO L158 Benchmark]: Witness Printer took 5.38ms. Allocated memory is still 352.3MB. Free memory was 284.8MB in the beginning and 284.8MB in the end (delta: 47.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:40,408 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.51ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 76.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.35ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 73.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 134.70ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 68.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1089.43ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 89.8MB in the end (delta: -21.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19991.56ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 89.3MB in the beginning and 284.8MB in the end (delta: -195.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 5.38ms. Allocated memory is still 352.3MB. Free memory was 284.8MB in the beginning and 284.8MB in the end (delta: 47.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[1] = { 5.95 }; [L25-L27] double double_Array_0[1] = { 5.95 }; [L28-L30] float float_Array_0[2] = { 2.25, 16.875 }; [L28-L30] float float_Array_0[2] = { 2.25, 16.875 }; [L28-L30] float float_Array_0[2] = { 2.25, 16.875 }; [L31-L33] signed char signed_char_Array_0[2] = { -4, 10 }; [L31-L33] signed char signed_char_Array_0[2] = { -4, 10 }; [L31-L33] signed char signed_char_Array_0[2] = { -4, 10 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -100 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -100 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L37-L39] unsigned char unsigned_char_Array_0[7] = { 128, 200, 32, 128, 1, 8, 32 }; [L40] signed long int last_1_signed_long_int_Array_0_0_ = -100; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L108] CALL updateLastVariables() [L98] EXPR signed_long_int_Array_0[0] [L98] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] CALL assume_abort_if_not(double_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] RET assume_abort_if_not(double_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] float_Array_0[1] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L77] EXPR float_Array_0[1] [L77] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L79] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[4] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[4] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] unsigned_char_Array_0[5] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L44] EXPR float_Array_0[1] [L44] float_Array_0[0] = float_Array_0[1] [L45] EXPR signed_char_Array_0[1] [L45] signed_char_Array_0[0] = signed_char_Array_0[1] [L46] EXPR float_Array_0[0] [L46] EXPR double_Array_0[0] [L46] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L46] COND FALSE !((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) [L49] EXPR float_Array_0[0] [L49] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L49] COND TRUE float_Array_0[0] <= double_Array_0[0] [L50] signed_long_int_Array_0[0] = 256 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L55] EXPR signed_long_int_Array_0[0] [L55] EXPR signed_char_Array_0[0] [L55] EXPR signed_long_int_Array_0[0] [L55] signed long int stepLocal_0 = (signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]; [L56] EXPR signed_char_Array_0[0] [L56] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0]) [L56] EXPR signed_long_int_Array_0[0] [L56] EXPR ((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_0=-327680, unsigned_char_Array_0={9:0}] [L56] COND TRUE stepLocal_0 < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0]))) [L57] EXPR unsigned_char_Array_0[2] [L57] unsigned_char_Array_0[6] = unsigned_char_Array_0[2] [L61] EXPR unsigned_char_Array_0[6] [L61] EXPR unsigned_char_Array_0[1] [L61] EXPR unsigned_char_Array_0[5] [L61] (unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L61] (unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L61] COND FALSE !((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) [L66] EXPR unsigned_char_Array_0[4] [L66] unsigned_char_Array_0[0] = unsigned_char_Array_0[4] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR signed_char_Array_0[0] [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR signed_char_Array_0[0] [L101] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0]) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR ((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) [L101] EXPR unsigned_char_Array_0[6] [L101] EXPR unsigned_char_Array_0[2] [L101] EXPR (((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0])))) [L101] EXPR float_Array_0[0] [L101] EXPR double_Array_0[0] [L101] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) [L101] EXPR signed_long_int_Array_0[0] [L101] EXPR signed_char_Array_0[0] [L101] EXPR unsigned_char_Array_0[2] [L101] EXPR signed_char_Array_0[0] [L101] EXPR ((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR ((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101] EXPR (((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L101-L102] return (((((((signed_long_int_Array_0[0] * signed_char_Array_0[0]) * signed_long_int_Array_0[0]) < ((((signed_char_Array_0[0]) > (signed_long_int_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2])) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[2]))) && (((float_Array_0[0] / double_Array_0[0]) >= (float_Array_0[0] / 128.6)) ? (signed_long_int_Array_0[0] == ((signed long int) ((signed_char_Array_0[0] + (unsigned_char_Array_0[2] + last_1_signed_long_int_Array_0_0_)) - signed_char_Array_0[0]))) : ((float_Array_0[0] <= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) 256)) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))))) && (((unsigned_char_Array_0[6] == (unsigned_char_Array_0[1] - unsigned_char_Array_0[5])) && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0] == ((unsigned char) (((((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) > (unsigned_char_Array_0[2])) ? ((unsigned_char_Array_0[3] - unsigned_char_Array_0[5])) : (unsigned_char_Array_0[2]))))) : 1) : (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[4])))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-100, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 11, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1765 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1764 mSDsluCounter, 6111 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4603 mSDsCounter, 510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1835 IncrementalHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 510 mSolverCounterUnsat, 1508 mSDtfsCounter, 1835 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 307 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=6, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 556 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1921 NumberOfCodeBlocks, 1921 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1493 ConstructedInterpolants, 0 QuantifiedInterpolants, 4571 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 5952/5984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:29:40,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/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_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/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 c0b4e00ed6b48bb07fe90a496ec4ca5231949ecbe9421f0d7744d947fc9f4864 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:29:43,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:29:43,666 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 03:29:43,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:29:43,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:29:43,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:29:43,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:29:43,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:29:43,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:29:43,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:29:43,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:29:43,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:29:43,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:29:43,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:29:43,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:29:43,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:29:43,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:29:43,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:29:43,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:29:43,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:29:43,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:29:43,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:29:43,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:29:43,704 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:29:43,704 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:29:43,704 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:29:43,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:29:43,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:29:43,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:29:43,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:29:43,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:29:43,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:43,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:43,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:43,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:43,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:29:43,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:29:43,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:29:43,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:29:43,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:43,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:29:43,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:29:43,707 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:29:43,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:29:43,707 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:29:43,707 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:29:43,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:29:43,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:29:43,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:29:43,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:29:43,708 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_5a176555-fd8a-45dc-ad23-d67071d6186b/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 -> c0b4e00ed6b48bb07fe90a496ec4ca5231949ecbe9421f0d7744d947fc9f4864 [2024-11-28 03:29:44,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:29:44,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:29:44,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:29:44,056 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:29:44,057 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:29:44,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i [2024-11-28 03:29:47,411 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data/9c320e37c/eb4a808f6e204f709ac50ad30f56f3a8/FLAG3f6e3ce2d [2024-11-28 03:29:47,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:29:47,806 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i [2024-11-28 03:29:47,819 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data/9c320e37c/eb4a808f6e204f709ac50ad30f56f3a8/FLAG3f6e3ce2d [2024-11-28 03:29:47,837 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/data/9c320e37c/eb4a808f6e204f709ac50ad30f56f3a8 [2024-11-28 03:29:47,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:29:47,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:29:47,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:47,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:29:47,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:29:47,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:47" (1/1) ... [2024-11-28 03:29:47,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd1369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:47, skipping insertion in model container [2024-11-28 03:29:47,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:29:47" (1/1) ... [2024-11-28 03:29:47,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:29:48,081 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_5a176555-fd8a-45dc-ad23-d67071d6186b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i[916,929] [2024-11-28 03:29:48,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:48,226 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:29:48,245 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_5a176555-fd8a-45dc-ad23-d67071d6186b/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-75.i[916,929] [2024-11-28 03:29:48,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:29:48,324 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:29:48,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48 WrapperNode [2024-11-28 03:29:48,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:29:48,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:48,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:29:48,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:29:48,332 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:29:48" (1/1) ... [2024-11-28 03:29:48,347 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:29:48" (1/1) ... [2024-11-28 03:29:48,383 INFO L138 Inliner]: procedures = 36, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 467 [2024-11-28 03:29:48,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:29:48,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:29:48,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:29:48,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:29:48,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,425 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 8, 11, 17, 21, 16, 56]. 43 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 2, 2, 1, 7]. The 18 writes are split as follows [0, 1, 1, 2, 2, 3, 9]. [2024-11-28 03:29:48,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,456 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:29:48,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:29:48,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:29:48,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:29:48,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (1/1) ... [2024-11-28 03:29:48,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:29:48,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:48,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/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:29:48,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/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:29:48,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:29:48,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-28 03:29:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-28 03:29:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-28 03:29:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-28 03:29:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-28 03:29:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-28 03:29:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-28 03:29:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-28 03:29:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-28 03:29:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-28 03:29:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-28 03:29:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-28 03:29:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-28 03:29:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-28 03:29:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 03:29:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 03:29:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-28 03:29:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-28 03:29:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-28 03:29:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-28 03:29:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-28 03:29:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:29:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 03:29:48,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-28 03:29:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-28 03:29:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-28 03:29:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 03:29:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 03:29:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:29:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:29:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-28 03:29:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-28 03:29:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-28 03:29:48,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-28 03:29:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-28 03:29:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-28 03:29:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-28 03:29:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 03:29:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 03:29:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 03:29:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-28 03:29:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-28 03:29:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-28 03:29:48,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-28 03:29:48,912 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:29:48,915 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:30:08,114 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-28 03:30:08,114 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:30:08,134 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:30:08,134 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:30:08,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:30:08 BoogieIcfgContainer [2024-11-28 03:30:08,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:30:08,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:30:08,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:30:08,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:30:08,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:29:47" (1/3) ... [2024-11-28 03:30:08,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a0ae16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:30:08, skipping insertion in model container [2024-11-28 03:30:08,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:29:48" (2/3) ... [2024-11-28 03:30:08,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a0ae16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:30:08, skipping insertion in model container [2024-11-28 03:30:08,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:30:08" (3/3) ... [2024-11-28 03:30:08,154 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-75.i [2024-11-28 03:30:08,172 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:30:08,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-75.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:30:08,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:30:08,249 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;@7c1b96b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:30:08,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:30:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:30:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:30:08,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:08,270 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:08,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:30:08,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1312223039, now seen corresponding path program 1 times [2024-11-28 03:30:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146707676] [2024-11-28 03:30:08,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:08,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:30:08,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:30:08,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-28 03:30:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:10,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:30:10,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-28 03:30:10,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:10,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146707676] [2024-11-28 03:30:10,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146707676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:10,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:10,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:30:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694092395] [2024-11-28 03:30:10,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:10,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:30:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:10,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:30:10,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:30:10,643 INFO L87 Difference]: Start difference. First operand has 97 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:30:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:10,677 INFO L93 Difference]: Finished difference Result 187 states and 295 transitions. [2024-11-28 03:30:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:30:10,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-11-28 03:30:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:10,686 INFO L225 Difference]: With dead ends: 187 [2024-11-28 03:30:10,687 INFO L226 Difference]: Without dead ends: 93 [2024-11-28 03:30:10,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:30:10,693 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:10,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:30:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-28 03:30:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-28 03:30:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:30:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-28 03:30:10,748 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 136 [2024-11-28 03:30:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-28 03:30:10,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:30:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-28 03:30:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:30:10,754 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:10,754 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:10,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-28 03:30:10,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:10,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:30:10,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 713516633, now seen corresponding path program 1 times [2024-11-28 03:30:10,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:10,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104262191] [2024-11-28 03:30:10,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:30:10,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:30:10,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-28 03:30:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:12,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:30:13,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-28 03:30:13,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:13,317 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104262191] [2024-11-28 03:30:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104262191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:13,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:13,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:30:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399241397] [2024-11-28 03:30:13,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:13,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:30:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:13,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:30:13,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:30:13,325 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:30:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:13,752 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2024-11-28 03:30:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:30:13,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-11-28 03:30:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:13,758 INFO L225 Difference]: With dead ends: 185 [2024-11-28 03:30:13,759 INFO L226 Difference]: Without dead ends: 95 [2024-11-28 03:30:13,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:30:13,760 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:13,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 03:30:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-28 03:30:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-28 03:30:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:30:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-28 03:30:13,787 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2024-11-28 03:30:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:13,788 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-28 03:30:13,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-28 03:30:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-28 03:30:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:30:13,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:13,795 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:13,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-28 03:30:13,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:13,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:30:13,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1995688919, now seen corresponding path program 1 times [2024-11-28 03:30:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409702593] [2024-11-28 03:30:13,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:13,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:13,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:30:14,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:30:14,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-28 03:30:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:16,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:30:16,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:30:16,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:16,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409702593] [2024-11-28 03:30:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409702593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:16,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:16,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:30:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521649179] [2024-11-28 03:30:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:30:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:16,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:30:16,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:30:16,482 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:30:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:17,232 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2024-11-28 03:30:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:30:17,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-28 03:30:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:17,238 INFO L225 Difference]: With dead ends: 192 [2024-11-28 03:30:17,238 INFO L226 Difference]: Without dead ends: 100 [2024-11-28 03:30:17,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:30:17,240 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:17,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 03:30:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-28 03:30:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-28 03:30:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:30:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-28 03:30:17,276 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2024-11-28 03:30:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:17,277 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-28 03:30:17,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:30:17,277 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-28 03:30:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:30:17,279 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:17,280 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:17,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-28 03:30:17,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:17,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:30:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash -524271015, now seen corresponding path program 1 times [2024-11-28 03:30:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:17,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949240051] [2024-11-28 03:30:17,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:17,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:17,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:30:17,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:30:17,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-28 03:30:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:19,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:30:19,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:30:20,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:30:20,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:30:20,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949240051] [2024-11-28 03:30:20,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949240051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:30:20,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:30:20,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:30:20,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907259602] [2024-11-28 03:30:20,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:30:20,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:30:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:30:20,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:30:20,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:30:20,334 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:30:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:30:21,176 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-28 03:30:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:30:21,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-28 03:30:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:30:21,179 INFO L225 Difference]: With dead ends: 198 [2024-11-28 03:30:21,179 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 03:30:21,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:30:21,181 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-28 03:30:21,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 624 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-28 03:30:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 03:30:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-28 03:30:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-28 03:30:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-28 03:30:21,192 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 136 [2024-11-28 03:30:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:30:21,193 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-28 03:30:21,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:30:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-28 03:30:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:30:21,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:30:21,196 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:30:21,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-28 03:30:21,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:21,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:30:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:30:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash -522423973, now seen corresponding path program 1 times [2024-11-28 03:30:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:30:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480872210] [2024-11-28 03:30:21,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:30:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:30:21,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:30:21,401 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:30:21,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-28 03:30:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:30:32,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 03:30:32,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:30:45,977 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 31 treesize of output 24 [2024-11-28 03:30:46,830 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 36 treesize of output 30 [2024-11-28 03:30:46,882 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 40 treesize of output 33 [2024-11-28 03:30:52,555 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 81 treesize of output 57 [2024-11-28 03:30:53,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:30:53,996 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 163 treesize of output 93 [2024-11-28 03:30:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-28 03:30:56,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:31:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:31:15,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:31:15,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480872210] [2024-11-28 03:31:15,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480872210] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 03:31:15,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:31:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-11-28 03:31:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679185322] [2024-11-28 03:31:15,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:31:15,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:31:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:31:15,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:31:15,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=317, Unknown=2, NotChecked=0, Total=380 [2024-11-28 03:31:15,453 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:31:20,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:31:24,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:31:28,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:31:33,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:31:37,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:31:41,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:31:45,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:31:56,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:01,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:05,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:09,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:13,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:17,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:21,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:32:23,604 INFO L93 Difference]: Finished difference Result 269 states and 381 transitions. [2024-11-28 03:32:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:32:23,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-28 03:32:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:32:23,610 INFO L225 Difference]: With dead ends: 269 [2024-11-28 03:32:23,610 INFO L226 Difference]: Without dead ends: 171 [2024-11-28 03:32:23,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=84, Invalid=420, Unknown=2, NotChecked=0, Total=506 [2024-11-28 03:32:23,612 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 237 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 24 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.9s IncrementalHoareTripleChecker+Time [2024-11-28 03:32:23,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 569 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 92 Invalid, 14 Unknown, 0 Unchecked, 64.9s Time] [2024-11-28 03:32:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-28 03:32:23,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-11-28 03:32:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 144 states have internal predecessors, (194), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-28 03:32:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 238 transitions. [2024-11-28 03:32:23,629 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 238 transitions. Word has length 136 [2024-11-28 03:32:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:32:23,630 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 238 transitions. [2024-11-28 03:32:23,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:32:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 238 transitions. [2024-11-28 03:32:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-28 03:32:23,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:32:23,634 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:32:23,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-28 03:32:23,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:32:23,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:32:23,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:32:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash 64382041, now seen corresponding path program 1 times [2024-11-28 03:32:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:32:23,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743455409] [2024-11-28 03:32:23,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:32:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:32:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:32:23,840 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:32:23,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-28 03:32:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:32:26,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:32:26,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:32:26,186 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 8 treesize of output 1 [2024-11-28 03:32:26,224 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 21 treesize of output 21 [2024-11-28 03:32:26,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:32:26,453 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-28 03:32:26,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:32:26,633 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 66 treesize of output 30 [2024-11-28 03:32:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:32:27,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:32:27,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:32:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743455409] [2024-11-28 03:32:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743455409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:32:27,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:32:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:32:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858543025] [2024-11-28 03:32:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:32:27,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:32:27,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:32:27,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:32:27,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:32:27,093 INFO L87 Difference]: Start difference. First operand 168 states and 238 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:32:31,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:38,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:42,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:46,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:32:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:32:46,718 INFO L93 Difference]: Finished difference Result 333 states and 472 transitions. [2024-11-28 03:32:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:32:46,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-28 03:32:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:32:46,723 INFO L225 Difference]: With dead ends: 333 [2024-11-28 03:32:46,723 INFO L226 Difference]: Without dead ends: 168 [2024-11-28 03:32:46,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:32:46,724 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 91 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:32:46,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 364 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 4 Unknown, 0 Unchecked, 19.3s Time] [2024-11-28 03:32:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-28 03:32:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-28 03:32:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 143 states have internal predecessors, (191), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-28 03:32:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 235 transitions. [2024-11-28 03:32:46,744 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 235 transitions. Word has length 136 [2024-11-28 03:32:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:32:46,745 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 235 transitions. [2024-11-28 03:32:46,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:32:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 235 transitions. [2024-11-28 03:32:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-28 03:32:46,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:32:46,748 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:32:46,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-28 03:32:46,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:32:46,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:32:46,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:32:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1187776756, now seen corresponding path program 1 times [2024-11-28 03:32:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:32:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508595875] [2024-11-28 03:32:46,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:32:46,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:32:46,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:32:46,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:32:46,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-28 03:32:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:32:51,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-28 03:32:51,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:32:58,916 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 8 treesize of output 1 [2024-11-28 03:33:02,083 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 26 treesize of output 25 [2024-11-28 03:33:05,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:05,073 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 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-28 03:33:07,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:07,616 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 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-28 03:33:10,298 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 31 treesize of output 24 [2024-11-28 03:33:11,383 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 46 treesize of output 39 [2024-11-28 03:33:15,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:15,721 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 1 case distinctions, treesize of input 65 treesize of output 61 [2024-11-28 03:33:19,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:33:19,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 64 [2024-11-28 03:33:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 363 proven. 48 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-28 03:33:30,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:33:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:33:46,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:33:46,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508595875] [2024-11-28 03:33:46,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508595875] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-28 03:33:46,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:33:46,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 31 [2024-11-28 03:33:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24046388] [2024-11-28 03:33:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:46,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:33:46,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:33:46,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:33:46,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2024-11-28 03:33:46,267 INFO L87 Difference]: Start difference. First operand 168 states and 235 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:34:11,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:15,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:19,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:25,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:29,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:33,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:37,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:41,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:45,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:49,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:53,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:57,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:01,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:05,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:09,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:13,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:17,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:21,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:25,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:29,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:35,202 INFO L93 Difference]: Finished difference Result 423 states and 592 transitions. [2024-11-28 03:35:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:35:35,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-11-28 03:35:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:35,206 INFO L225 Difference]: With dead ends: 423 [2024-11-28 03:35:35,206 INFO L226 Difference]: Without dead ends: 258 [2024-11-28 03:35:35,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 03:35:35,211 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 514 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 38 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:35,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 874 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 326 Invalid, 20 Unknown, 0 Unchecked, 102.0s Time] [2024-11-28 03:35:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-28 03:35:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 202. [2024-11-28 03:35:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 176 states have (on average 1.375) internal successors, (242), 177 states have internal predecessors, (242), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-28 03:35:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 286 transitions. [2024-11-28 03:35:35,244 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 286 transitions. Word has length 138 [2024-11-28 03:35:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:35,245 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 286 transitions. [2024-11-28 03:35:35,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:35:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 286 transitions. [2024-11-28 03:35:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-28 03:35:35,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:35,249 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:35,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-28 03:35:35,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:35:35,452 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:35,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1356838273, now seen corresponding path program 1 times [2024-11-28 03:35:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:35,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612119942] [2024-11-28 03:35:35,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:35,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:35:35,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:35:35,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:35:35,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-28 03:35:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:39,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:35:39,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:39,185 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:35:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:35:39,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:35:39,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:35:39,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612119942] [2024-11-28 03:35:39,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612119942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:39,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:39,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:35:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551237331] [2024-11-28 03:35:39,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:39,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:35:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:35:39,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:35:39,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:35:39,487 INFO L87 Difference]: Start difference. First operand 202 states and 286 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:35:44,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:49,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:54,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:58,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:03,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:07,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:11,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:36:12,181 INFO L93 Difference]: Finished difference Result 501 states and 709 transitions. [2024-11-28 03:36:12,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:36:12,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-28 03:36:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:36:12,188 INFO L225 Difference]: With dead ends: 501 [2024-11-28 03:36:12,188 INFO L226 Difference]: Without dead ends: 302 [2024-11-28 03:36:12,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:36:12,189 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 127 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:36:12,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 596 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 7 Unknown, 0 Unchecked, 32.6s Time] [2024-11-28 03:36:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-28 03:36:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 204. [2024-11-28 03:36:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 179 states have internal predecessors, (244), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-28 03:36:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 288 transitions. [2024-11-28 03:36:12,210 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 288 transitions. Word has length 139 [2024-11-28 03:36:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:36:12,212 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 288 transitions. [2024-11-28 03:36:12,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:36:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 288 transitions. [2024-11-28 03:36:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-28 03:36:12,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:36:12,214 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:36:12,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-28 03:36:12,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:36:12,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:36:12,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:36:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash -116915201, now seen corresponding path program 1 times [2024-11-28 03:36:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:36:12,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022229415] [2024-11-28 03:36:12,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:36:12,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:36:12,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:36:12,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:36:12,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-28 03:36:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:36:16,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:36:16,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:36:16,136 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:36:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-28 03:36:16,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:36:16,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:36:16,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022229415] [2024-11-28 03:36:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022229415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:36:16,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:36:16,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:36:16,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859739280] [2024-11-28 03:36:16,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:36:16,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:36:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:36:16,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:36:16,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:36:16,813 INFO L87 Difference]: Start difference. First operand 204 states and 288 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:36:21,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:26,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:31,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:35,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:40,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:44,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:49,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 03:36:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:36:49,487 INFO L93 Difference]: Finished difference Result 503 states and 710 transitions. [2024-11-28 03:36:49,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:36:49,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-28 03:36:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:36:49,495 INFO L225 Difference]: With dead ends: 503 [2024-11-28 03:36:49,495 INFO L226 Difference]: Without dead ends: 302 [2024-11-28 03:36:49,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:36:49,496 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 120 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:36:49,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 599 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 32.5s Time] [2024-11-28 03:36:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-28 03:36:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 213. [2024-11-28 03:36:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 187 states have (on average 1.3796791443850267) internal successors, (258), 188 states have internal predecessors, (258), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-28 03:36:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 302 transitions. [2024-11-28 03:36:49,525 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 302 transitions. Word has length 139 [2024-11-28 03:36:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:36:49,526 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 302 transitions. [2024-11-28 03:36:49,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-28 03:36:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 302 transitions. [2024-11-28 03:36:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-28 03:36:49,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:36:49,529 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:36:49,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-28 03:36:49,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:36:49,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:36:49,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:36:49,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1137983555, now seen corresponding path program 1 times [2024-11-28 03:36:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:36:49,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309252420] [2024-11-28 03:36:49,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:36:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:36:49,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:36:49,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:36:49,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a176555-fd8a-45dc-ad23-d67071d6186b/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-28 03:36:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:36:53,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-28 03:36:53,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:37:10,262 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 116 treesize of output 80 [2024-11-28 03:37:10,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:37:10,688 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 216 treesize of output 96 [2024-11-28 03:37:19,088 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:27,310 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:35,723 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:44,168 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:52,575 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:56,720 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse0 (let ((.cse3 (concat v_arrayElimCell_26 v_arrayElimCell_25))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (and (= .cse0 |c_ULTIMATE.start_step_#t~mem13#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))))) (= |c_ULTIMATE.start_step_#t~mem12#1| .cse1) (not (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.geq (fp.div c_currentRoundingMode .cse2 .cse0) (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 643.0 5.0)))))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:38:09,082 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:16,149 WARN L286 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:24,552 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:32,951 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:37,054 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24)))) (.cse1 (let ((.cse2 (concat v_arrayElimCell_26 v_arrayElimCell_25))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (and (not (fp.geq (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 643.0 5.0))))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0)))) (fp.leq .cse0 .cse1)))) is different from false [2024-11-28 03:38:41,134 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_26 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24)))) (.cse1 (let ((.cse2 (concat v_arrayElimCell_26 v_arrayElimCell_25))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (and (not (fp.geq (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 643.0 5.0))))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0)))) (fp.leq .cse0 .cse1)))) is different from true [2024-11-28 03:38:53,483 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:01,902 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:10,294 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:18,694 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:31,066 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:39,483 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:47,928 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:56,322 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:08,631 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:16,975 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:25,317 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:33,700 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:46,040 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:54,434 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:02,839 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:11,235 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:23,610 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:32,026 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:40,378 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:48,748 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:58,445 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:05,733 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:14,151 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:22,560 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:34,927 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:43,292 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:51,668 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:43:00,074 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:43:10,533 WARN L286 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:43:18,969 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:43:25,833 WARN L286 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:43:34,214 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:43:46,615 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:43:55,038 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:03,422 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)