./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd --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 e68bf11432a02c4ee2bd8f03ee2807d4845705e500d61756e972fae2c63173ed --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:47:49,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:47:49,967 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:47:49,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:47:49,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:47:50,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:47:50,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:47:50,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:47:50,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:47:50,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:47:50,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:47:50,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:47:50,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:47:50,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:47:50,019 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:47:50,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:47:50,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:47:50,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:47:50,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:47:50,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:47:50,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:47:50,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:47:50,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:47:50,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:47:50,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:47:50,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:47:50,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:47:50,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:47:50,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:47:50,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:47:50,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:47:50,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:47:50,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:47:50,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:47:50,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:47:50,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:47:50,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:47:50,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:47:50,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:47:50,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:47:50,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:47:50,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:47:50,026 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_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd 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 -> e68bf11432a02c4ee2bd8f03ee2807d4845705e500d61756e972fae2c63173ed [2024-11-13 14:47:50,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:47:50,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:47:50,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:47:50,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:47:50,336 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:47:50,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i Unable to find full path for "g++" [2024-11-13 14:47:52,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:47:52,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:47:52,746 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i [2024-11-13 14:47:52,767 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/data/f893c8016/8dadc2b6caa04c298ddfb361c34f1fae/FLAG920e94c4d [2024-11-13 14:47:52,787 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/data/f893c8016/8dadc2b6caa04c298ddfb361c34f1fae [2024-11-13 14:47:52,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:47:52,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:47:52,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:47:52,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:47:52,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:47:52,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:52,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e99969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:52, skipping insertion in model container [2024-11-13 14:47:52,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:47:52" (1/1) ... [2024-11-13 14:47:52,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:47:53,018 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_eae56205-d7a0-4858-9082-ab6bae880bac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i[917,930] [2024-11-13 14:47:53,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:47:53,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:47:53,116 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_eae56205-d7a0-4858-9082-ab6bae880bac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i[917,930] [2024-11-13 14:47:53,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:47:53,173 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:47:53,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53 WrapperNode [2024-11-13 14:47:53,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:47:53,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:47:53,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:47:53,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:47:53,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,261 INFO L138 Inliner]: procedures = 29, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2024-11-13 14:47:53,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:47:53,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:47:53,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:47:53,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:47:53,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,311 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2024-11-13 14:47:53,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:47:53,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:47:53,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:47:53,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:47:53,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (1/1) ... [2024-11-13 14:47:53,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:47:53,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:47:53,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:47:53,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:47:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:47:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-13 14:47:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-13 14:47:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-13 14:47:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-13 14:47:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-13 14:47:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:47:53,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 14:47:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 14:47:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 14:47:53,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:47:53,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:47:53,742 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:47:53,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:47:54,569 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-13 14:47:54,569 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:47:54,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:47:54,587 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:47:54,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:47:54 BoogieIcfgContainer [2024-11-13 14:47:54,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:47:54,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:47:54,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:47:54,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:47:54,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:47:52" (1/3) ... [2024-11-13 14:47:54,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b2d0ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:47:54, skipping insertion in model container [2024-11-13 14:47:54,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:47:53" (2/3) ... [2024-11-13 14:47:54,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b2d0ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:47:54, skipping insertion in model container [2024-11-13 14:47:54,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:47:54" (3/3) ... [2024-11-13 14:47:54,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-18.i [2024-11-13 14:47:54,618 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:47:54,620 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-18.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:47:54,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:47:54,714 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;@64d440bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:47:54,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:47:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:47:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:47:54,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:47:54,735 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:47:54,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:47:54,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:47:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash -113358264, now seen corresponding path program 1 times [2024-11-13 14:47:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:47:54,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107792884] [2024-11-13 14:47:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:47:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:47:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:47:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:47:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:47:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:47:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:47:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:47:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:47:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:47:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:47:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:47:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:47:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:47:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:47:55,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:47:55,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107792884] [2024-11-13 14:47:55,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107792884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:47:55,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:47:55,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:47:55,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055507230] [2024-11-13 14:47:55,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:47:55,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:47:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:47:55,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:47:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:47:55,335 INFO L87 Difference]: Start difference. First operand has 108 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:47:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:47:55,367 INFO L93 Difference]: Finished difference Result 209 states and 326 transitions. [2024-11-13 14:47:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:47:55,369 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-11-13 14:47:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:47:55,379 INFO L225 Difference]: With dead ends: 209 [2024-11-13 14:47:55,380 INFO L226 Difference]: Without dead ends: 104 [2024-11-13 14:47:55,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-13 14:47:55,386 INFO L432 NwaCegarLoop]: 153 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, 153 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-13 14:47:55,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:47:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-13 14:47:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-13 14:47:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:47:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2024-11-13 14:47:55,440 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 107 [2024-11-13 14:47:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:47:55,441 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2024-11-13 14:47:55,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:47:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2024-11-13 14:47:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:47:55,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:47:55,449 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:47:55,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:47:55,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:47:55,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:47:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1593452532, now seen corresponding path program 1 times [2024-11-13 14:47:55,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:47:55,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108243274] [2024-11-13 14:47:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:47:55,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:47:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:47:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:47:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:47:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:47:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:47:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:47:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:47:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:47:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:47:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:47:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:47:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:47:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:47:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:47:56,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108243274] [2024-11-13 14:47:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108243274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:47:56,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:47:56,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:47:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153567567] [2024-11-13 14:47:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:47:56,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:47:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:47:56,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:47:56,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:47:56,881 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:47:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:47:57,336 INFO L93 Difference]: Finished difference Result 279 states and 410 transitions. [2024-11-13 14:47:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:47:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-13 14:47:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:47:57,341 INFO L225 Difference]: With dead ends: 279 [2024-11-13 14:47:57,345 INFO L226 Difference]: Without dead ends: 178 [2024-11-13 14:47:57,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:47:57,348 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 196 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:47:57,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 593 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:47:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-13 14:47:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-11-13 14:47:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 153 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 14:47:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 257 transitions. [2024-11-13 14:47:57,398 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 257 transitions. Word has length 107 [2024-11-13 14:47:57,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:47:57,399 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 257 transitions. [2024-11-13 14:47:57,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:47:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2024-11-13 14:47:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 14:47:57,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:47:57,402 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:47:57,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:47:57,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:47:57,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:47:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1851617970, now seen corresponding path program 1 times [2024-11-13 14:47:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:47:57,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566090229] [2024-11-13 14:47:57,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:47:57,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:47:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:47:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:47:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:47:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:47:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:47:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:47:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:47:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:47:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:47:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:47:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:47:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:47:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:47:58,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:47:58,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566090229] [2024-11-13 14:47:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566090229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:47:58,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:47:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:47:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766643934] [2024-11-13 14:47:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:47:58,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:47:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:47:58,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:47:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:47:58,836 INFO L87 Difference]: Start difference. First operand 175 states and 257 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:47:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:47:59,243 INFO L93 Difference]: Finished difference Result 448 states and 661 transitions. [2024-11-13 14:47:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:47:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-11-13 14:47:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:47:59,247 INFO L225 Difference]: With dead ends: 448 [2024-11-13 14:47:59,247 INFO L226 Difference]: Without dead ends: 276 [2024-11-13 14:47:59,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:47:59,249 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 125 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:47:59,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 569 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:47:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-13 14:47:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 271. [2024-11-13 14:47:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 235 states have (on average 1.4297872340425533) internal successors, (336), 236 states have internal predecessors, (336), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 14:47:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 400 transitions. [2024-11-13 14:47:59,299 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 400 transitions. Word has length 107 [2024-11-13 14:47:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:47:59,300 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 400 transitions. [2024-11-13 14:47:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:47:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 400 transitions. [2024-11-13 14:47:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:47:59,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:47:59,304 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:47:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:47:59,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:47:59,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:47:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash 135060698, now seen corresponding path program 1 times [2024-11-13 14:47:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:47:59,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398822432] [2024-11-13 14:47:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:47:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:47:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:47:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:47:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:47:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:47:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:47:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:47:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:47:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:47:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:47:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:47:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:47:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:47:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:47:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:47:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:47:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398822432] [2024-11-13 14:47:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398822432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:47:59,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:47:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:47:59,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101869355] [2024-11-13 14:47:59,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:47:59,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:47:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:47:59,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:47:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:47:59,878 INFO L87 Difference]: Start difference. First operand 271 states and 400 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:00,188 INFO L93 Difference]: Finished difference Result 635 states and 932 transitions. [2024-11-13 14:48:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:48:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-13 14:48:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:00,193 INFO L225 Difference]: With dead ends: 635 [2024-11-13 14:48:00,194 INFO L226 Difference]: Without dead ends: 367 [2024-11-13 14:48:00,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:48:00,199 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 236 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:00,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 597 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:48:00,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-13 14:48:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 230. [2024-11-13 14:48:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 201 states have (on average 1.4228855721393034) internal successors, (286), 201 states have internal predecessors, (286), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:48:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 334 transitions. [2024-11-13 14:48:00,246 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 334 transitions. Word has length 108 [2024-11-13 14:48:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:00,249 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 334 transitions. [2024-11-13 14:48:00,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 334 transitions. [2024-11-13 14:48:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:48:00,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:00,251 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:00,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:48:00,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:00,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1357639794, now seen corresponding path program 1 times [2024-11-13 14:48:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:00,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545073198] [2024-11-13 14:48:00,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 14:48:01,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545073198] [2024-11-13 14:48:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545073198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:48:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650632447] [2024-11-13 14:48:01,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:01,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:01,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:01,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:48:01,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:48:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:02,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 14:48:02,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:48:02,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:48:03,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 14:48:03,178 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 26 treesize of output 14 [2024-11-13 14:48:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:48:03,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:48:03,865 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 32 [2024-11-13 14:48:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 14:48:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650632447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:48:04,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:48:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2024-11-13 14:48:04,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585030078] [2024-11-13 14:48:04,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:48:04,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 14:48:04,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:04,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 14:48:04,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:48:04,088 INFO L87 Difference]: Start difference. First operand 230 states and 334 transitions. Second operand has 29 states, 26 states have (on average 4.153846153846154) internal successors, (108), 27 states have internal predecessors, (108), 7 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2024-11-13 14:48:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:06,418 INFO L93 Difference]: Finished difference Result 729 states and 1045 transitions. [2024-11-13 14:48:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 14:48:06,420 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.153846153846154) internal successors, (108), 27 states have internal predecessors, (108), 7 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) Word has length 108 [2024-11-13 14:48:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:06,428 INFO L225 Difference]: With dead ends: 729 [2024-11-13 14:48:06,428 INFO L226 Difference]: Without dead ends: 502 [2024-11-13 14:48:06,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=511, Invalid=2351, Unknown=0, NotChecked=0, Total=2862 [2024-11-13 14:48:06,436 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1848 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:06,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 1614 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:48:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-13 14:48:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 482. [2024-11-13 14:48:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 421 states have (on average 1.3871733966745843) internal successors, (584), 421 states have internal predecessors, (584), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:48:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 680 transitions. [2024-11-13 14:48:06,510 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 680 transitions. Word has length 108 [2024-11-13 14:48:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:06,511 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 680 transitions. [2024-11-13 14:48:06,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.153846153846154) internal successors, (108), 27 states have internal predecessors, (108), 7 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2024-11-13 14:48:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 680 transitions. [2024-11-13 14:48:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 14:48:06,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:06,513 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:06,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:48:06,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:06,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:06,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2082146602, now seen corresponding path program 1 times [2024-11-13 14:48:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459448984] [2024-11-13 14:48:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:07,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:07,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459448984] [2024-11-13 14:48:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459448984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:07,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 14:48:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366154196] [2024-11-13 14:48:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:07,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:48:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:48:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:48:07,730 INFO L87 Difference]: Start difference. First operand 482 states and 680 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:08,691 INFO L93 Difference]: Finished difference Result 941 states and 1326 transitions. [2024-11-13 14:48:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:48:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-13 14:48:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:08,698 INFO L225 Difference]: With dead ends: 941 [2024-11-13 14:48:08,700 INFO L226 Difference]: Without dead ends: 673 [2024-11-13 14:48:08,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:48:08,702 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 112 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:08,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1204 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:48:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-13 14:48:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 501. [2024-11-13 14:48:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 440 states have (on average 1.3818181818181818) internal successors, (608), 440 states have internal predecessors, (608), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:48:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 704 transitions. [2024-11-13 14:48:08,806 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 704 transitions. Word has length 109 [2024-11-13 14:48:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:08,807 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 704 transitions. [2024-11-13 14:48:08,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 704 transitions. [2024-11-13 14:48:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:48:08,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:08,810 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:08,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:48:08,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:08,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash -562094620, now seen corresponding path program 1 times [2024-11-13 14:48:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:08,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873749122] [2024-11-13 14:48:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:09,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:09,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873749122] [2024-11-13 14:48:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873749122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:09,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:09,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:48:09,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756485839] [2024-11-13 14:48:09,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:09,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:48:09,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:09,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:48:09,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:48:09,145 INFO L87 Difference]: Start difference. First operand 501 states and 704 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:09,304 INFO L93 Difference]: Finished difference Result 979 states and 1371 transitions. [2024-11-13 14:48:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:48:09,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-13 14:48:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:09,308 INFO L225 Difference]: With dead ends: 979 [2024-11-13 14:48:09,308 INFO L226 Difference]: Without dead ends: 481 [2024-11-13 14:48:09,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:48:09,310 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 145 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:09,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 690 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:48:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-13 14:48:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 242. [2024-11-13 14:48:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 211 states have (on average 1.3601895734597156) internal successors, (287), 211 states have internal predecessors, (287), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:48:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 335 transitions. [2024-11-13 14:48:09,364 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 335 transitions. Word has length 110 [2024-11-13 14:48:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:09,365 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 335 transitions. [2024-11-13 14:48:09,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 335 transitions. [2024-11-13 14:48:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 14:48:09,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:09,367 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:09,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:48:09,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:09,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:09,368 INFO L85 PathProgramCache]: Analyzing trace with hash -105823525, now seen corresponding path program 1 times [2024-11-13 14:48:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432585041] [2024-11-13 14:48:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:09,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:10,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432585041] [2024-11-13 14:48:10,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432585041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:10,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:10,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:48:10,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123461410] [2024-11-13 14:48:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:10,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:48:10,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:10,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:48:10,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:48:10,028 INFO L87 Difference]: Start difference. First operand 242 states and 335 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:10,819 INFO L93 Difference]: Finished difference Result 717 states and 992 transitions. [2024-11-13 14:48:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:48:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-13 14:48:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:10,823 INFO L225 Difference]: With dead ends: 717 [2024-11-13 14:48:10,823 INFO L226 Difference]: Without dead ends: 473 [2024-11-13 14:48:10,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:48:10,824 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 298 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:10,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 895 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:48:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-13 14:48:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 466. [2024-11-13 14:48:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 414 states have (on average 1.3695652173913044) internal successors, (567), 417 states have internal predecessors, (567), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:48:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 647 transitions. [2024-11-13 14:48:10,910 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 647 transitions. Word has length 111 [2024-11-13 14:48:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:10,910 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 647 transitions. [2024-11-13 14:48:10,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 647 transitions. [2024-11-13 14:48:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 14:48:10,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:10,914 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:10,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:48:10,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:10,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash -782028760, now seen corresponding path program 1 times [2024-11-13 14:48:10,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:10,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646229749] [2024-11-13 14:48:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:10,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:11,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646229749] [2024-11-13 14:48:11,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646229749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:11,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:11,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:48:11,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181201132] [2024-11-13 14:48:11,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:11,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:48:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:11,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:48:11,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:48:11,146 INFO L87 Difference]: Start difference. First operand 466 states and 647 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:11,304 INFO L93 Difference]: Finished difference Result 944 states and 1311 transitions. [2024-11-13 14:48:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:48:11,304 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-13 14:48:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:11,308 INFO L225 Difference]: With dead ends: 944 [2024-11-13 14:48:11,309 INFO L226 Difference]: Without dead ends: 481 [2024-11-13 14:48:11,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:48:11,311 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:11,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:48:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-13 14:48:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2024-11-13 14:48:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 429 states have (on average 1.3566433566433567) internal successors, (582), 432 states have internal predecessors, (582), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:48:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 662 transitions. [2024-11-13 14:48:11,437 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 662 transitions. Word has length 111 [2024-11-13 14:48:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:11,438 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 662 transitions. [2024-11-13 14:48:11,438 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 662 transitions. [2024-11-13 14:48:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 14:48:11,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:11,441 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:11,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:48:11,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:11,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1577993893, now seen corresponding path program 1 times [2024-11-13 14:48:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:11,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071121144] [2024-11-13 14:48:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:12,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071121144] [2024-11-13 14:48:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071121144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:12,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:48:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954105709] [2024-11-13 14:48:12,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:12,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:48:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:48:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:48:12,171 INFO L87 Difference]: Start difference. First operand 481 states and 662 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:13,166 INFO L93 Difference]: Finished difference Result 783 states and 1072 transitions. [2024-11-13 14:48:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:48:13,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-13 14:48:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:13,170 INFO L225 Difference]: With dead ends: 783 [2024-11-13 14:48:13,170 INFO L226 Difference]: Without dead ends: 488 [2024-11-13 14:48:13,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:48:13,171 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 296 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:13,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1243 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:48:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-13 14:48:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 481. [2024-11-13 14:48:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 429 states have (on average 1.3543123543123543) internal successors, (581), 432 states have internal predecessors, (581), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:48:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 661 transitions. [2024-11-13 14:48:13,266 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 661 transitions. Word has length 111 [2024-11-13 14:48:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:13,267 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 661 transitions. [2024-11-13 14:48:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 661 transitions. [2024-11-13 14:48:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:48:13,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:13,271 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:13,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:48:13,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:13,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1792734381, now seen corresponding path program 1 times [2024-11-13 14:48:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:13,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605356049] [2024-11-13 14:48:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605356049] [2024-11-13 14:48:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605356049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:14,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:14,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:48:14,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204719669] [2024-11-13 14:48:14,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:48:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:48:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:48:14,088 INFO L87 Difference]: Start difference. First operand 481 states and 661 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:15,265 INFO L93 Difference]: Finished difference Result 1349 states and 1851 transitions. [2024-11-13 14:48:15,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:48:15,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-13 14:48:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:15,273 INFO L225 Difference]: With dead ends: 1349 [2024-11-13 14:48:15,273 INFO L226 Difference]: Without dead ends: 871 [2024-11-13 14:48:15,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:48:15,275 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 351 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:15,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1147 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 14:48:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-13 14:48:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 613. [2024-11-13 14:48:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 550 states have (on average 1.3527272727272728) internal successors, (744), 554 states have internal predecessors, (744), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:48:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 840 transitions. [2024-11-13 14:48:15,394 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 840 transitions. Word has length 112 [2024-11-13 14:48:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:15,395 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 840 transitions. [2024-11-13 14:48:15,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 840 transitions. [2024-11-13 14:48:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:48:15,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:15,398 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:15,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:48:15,398 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:15,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1205928367, now seen corresponding path program 1 times [2024-11-13 14:48:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298497227] [2024-11-13 14:48:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298497227] [2024-11-13 14:48:15,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298497227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:15,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:48:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107148923] [2024-11-13 14:48:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:15,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:48:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:48:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:48:15,882 INFO L87 Difference]: Start difference. First operand 613 states and 840 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:16,728 INFO L93 Difference]: Finished difference Result 2021 states and 2787 transitions. [2024-11-13 14:48:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:48:16,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-13 14:48:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:16,737 INFO L225 Difference]: With dead ends: 2021 [2024-11-13 14:48:16,738 INFO L226 Difference]: Without dead ends: 1411 [2024-11-13 14:48:16,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:48:16,740 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 425 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:16,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1268 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:48:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-13 14:48:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1090. [2024-11-13 14:48:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 976 states have (on average 1.3565573770491803) internal successors, (1324), 983 states have internal predecessors, (1324), 88 states have call successors, (88), 25 states have call predecessors, (88), 25 states have return successors, (88), 81 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-13 14:48:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1500 transitions. [2024-11-13 14:48:17,025 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1500 transitions. Word has length 112 [2024-11-13 14:48:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:17,026 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1500 transitions. [2024-11-13 14:48:17,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1500 transitions. [2024-11-13 14:48:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:48:17,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:17,030 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:17,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:48:17,030 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:17,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash 537816705, now seen corresponding path program 1 times [2024-11-13 14:48:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328038762] [2024-11-13 14:48:17,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:17,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:17,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328038762] [2024-11-13 14:48:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328038762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:17,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:17,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:48:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992894883] [2024-11-13 14:48:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:17,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:48:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:48:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:48:17,362 INFO L87 Difference]: Start difference. First operand 1090 states and 1500 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:17,894 INFO L93 Difference]: Finished difference Result 2034 states and 2792 transitions. [2024-11-13 14:48:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:48:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-13 14:48:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:17,902 INFO L225 Difference]: With dead ends: 2034 [2024-11-13 14:48:17,902 INFO L226 Difference]: Without dead ends: 1413 [2024-11-13 14:48:17,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:48:17,906 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 126 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:17,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 716 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:48:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-11-13 14:48:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1183. [2024-11-13 14:48:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1058 states have (on average 1.3563327032136105) internal successors, (1435), 1066 states have internal predecessors, (1435), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 14:48:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1627 transitions. [2024-11-13 14:48:18,128 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1627 transitions. Word has length 112 [2024-11-13 14:48:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:18,128 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1627 transitions. [2024-11-13 14:48:18,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1627 transitions. [2024-11-13 14:48:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:48:18,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:18,131 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:18,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:48:18,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:18,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash 4375839, now seen corresponding path program 1 times [2024-11-13 14:48:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260311546] [2024-11-13 14:48:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260311546] [2024-11-13 14:48:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260311546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:18,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:18,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:48:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406514423] [2024-11-13 14:48:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:18,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:48:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:48:18,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:48:18,869 INFO L87 Difference]: Start difference. First operand 1183 states and 1627 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:20,020 INFO L93 Difference]: Finished difference Result 1989 states and 2734 transitions. [2024-11-13 14:48:20,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:48:20,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-13 14:48:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:20,031 INFO L225 Difference]: With dead ends: 1989 [2024-11-13 14:48:20,032 INFO L226 Difference]: Without dead ends: 1377 [2024-11-13 14:48:20,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:48:20,034 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 234 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:20,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1396 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:48:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2024-11-13 14:48:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1181. [2024-11-13 14:48:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1056 states have (on average 1.356060606060606) internal successors, (1432), 1064 states have internal predecessors, (1432), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 14:48:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1624 transitions. [2024-11-13 14:48:20,258 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1624 transitions. Word has length 112 [2024-11-13 14:48:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:20,258 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 1624 transitions. [2024-11-13 14:48:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1624 transitions. [2024-11-13 14:48:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:48:20,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:20,261 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:20,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:48:20,262 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:20,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1502506760, now seen corresponding path program 1 times [2024-11-13 14:48:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:20,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628386235] [2024-11-13 14:48:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628386235] [2024-11-13 14:48:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628386235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:20,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:20,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:48:20,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784037905] [2024-11-13 14:48:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:20,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:48:20,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:48:20,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:48:20,622 INFO L87 Difference]: Start difference. First operand 1181 states and 1624 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:21,195 INFO L93 Difference]: Finished difference Result 2535 states and 3482 transitions. [2024-11-13 14:48:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:48:21,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:48:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:21,205 INFO L225 Difference]: With dead ends: 2535 [2024-11-13 14:48:21,205 INFO L226 Difference]: Without dead ends: 1357 [2024-11-13 14:48:21,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:48:21,210 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 111 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:21,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 672 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:48:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2024-11-13 14:48:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1205. [2024-11-13 14:48:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1080 states have (on average 1.35) internal successors, (1458), 1088 states have internal predecessors, (1458), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 14:48:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1650 transitions. [2024-11-13 14:48:21,506 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1650 transitions. Word has length 113 [2024-11-13 14:48:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:21,507 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1650 transitions. [2024-11-13 14:48:21,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1650 transitions. [2024-11-13 14:48:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:48:21,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:21,509 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:21,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:48:21,510 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:21,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1418173410, now seen corresponding path program 1 times [2024-11-13 14:48:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:21,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802343356] [2024-11-13 14:48:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:21,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:21,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:21,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802343356] [2024-11-13 14:48:21,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802343356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:21,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:21,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:48:21,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090235582] [2024-11-13 14:48:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:21,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:48:21,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:21,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:48:21,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:48:21,822 INFO L87 Difference]: Start difference. First operand 1205 states and 1650 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:22,339 INFO L93 Difference]: Finished difference Result 2567 states and 3510 transitions. [2024-11-13 14:48:22,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:48:22,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:48:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:22,348 INFO L225 Difference]: With dead ends: 2567 [2024-11-13 14:48:22,348 INFO L226 Difference]: Without dead ends: 1365 [2024-11-13 14:48:22,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:48:22,352 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 112 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:22,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 665 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:48:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-11-13 14:48:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1205. [2024-11-13 14:48:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1080 states have (on average 1.3462962962962963) internal successors, (1454), 1088 states have internal predecessors, (1454), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 14:48:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1646 transitions. [2024-11-13 14:48:22,604 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1646 transitions. Word has length 113 [2024-11-13 14:48:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:22,606 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1646 transitions. [2024-11-13 14:48:22,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1646 transitions. [2024-11-13 14:48:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:48:22,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:22,611 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:22,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:48:22,612 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:22,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2004979424, now seen corresponding path program 1 times [2024-11-13 14:48:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830708588] [2024-11-13 14:48:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:23,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:23,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830708588] [2024-11-13 14:48:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830708588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:23,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:48:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638336078] [2024-11-13 14:48:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:48:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:48:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:48:23,014 INFO L87 Difference]: Start difference. First operand 1205 states and 1646 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:23,630 INFO L93 Difference]: Finished difference Result 2555 states and 3485 transitions. [2024-11-13 14:48:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:48:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:48:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:23,643 INFO L225 Difference]: With dead ends: 2555 [2024-11-13 14:48:23,644 INFO L226 Difference]: Without dead ends: 1353 [2024-11-13 14:48:23,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:48:23,648 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 147 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:23,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 840 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:48:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-13 14:48:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 625. [2024-11-13 14:48:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 562 states have (on average 1.3380782918149465) internal successors, (752), 566 states have internal predecessors, (752), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:48:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 848 transitions. [2024-11-13 14:48:23,812 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 848 transitions. Word has length 113 [2024-11-13 14:48:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:23,813 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 848 transitions. [2024-11-13 14:48:23,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 848 transitions. [2024-11-13 14:48:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:48:23,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:23,815 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:23,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:48:23,816 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:23,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash -724867021, now seen corresponding path program 1 times [2024-11-13 14:48:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:23,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532701298] [2024-11-13 14:48:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532701298] [2024-11-13 14:48:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532701298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:48:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158960029] [2024-11-13 14:48:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:24,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:48:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:24,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:48:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:48:24,189 INFO L87 Difference]: Start difference. First operand 625 states and 848 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:24,596 INFO L93 Difference]: Finished difference Result 1820 states and 2477 transitions. [2024-11-13 14:48:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:48:24,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:48:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:24,608 INFO L225 Difference]: With dead ends: 1820 [2024-11-13 14:48:24,608 INFO L226 Difference]: Without dead ends: 1198 [2024-11-13 14:48:24,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:48:24,611 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 143 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:24,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 795 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:48:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-13 14:48:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1196. [2024-11-13 14:48:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1071 states have (on average 1.338001867413632) internal successors, (1433), 1079 states have internal predecessors, (1433), 96 states have call successors, (96), 28 states have call predecessors, (96), 28 states have return successors, (96), 88 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 14:48:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1625 transitions. [2024-11-13 14:48:24,848 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1625 transitions. Word has length 113 [2024-11-13 14:48:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:24,849 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1625 transitions. [2024-11-13 14:48:24,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1625 transitions. [2024-11-13 14:48:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:48:24,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:24,853 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 14:48:24,854 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash 831275117, now seen corresponding path program 1 times [2024-11-13 14:48:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282000391] [2024-11-13 14:48:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282000391] [2024-11-13 14:48:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282000391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:26,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 14:48:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124388735] [2024-11-13 14:48:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:26,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:48:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:48:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:48:26,712 INFO L87 Difference]: Start difference. First operand 1196 states and 1625 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:28,661 INFO L93 Difference]: Finished difference Result 1698 states and 2308 transitions. [2024-11-13 14:48:28,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:48:28,662 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:48:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:28,670 INFO L225 Difference]: With dead ends: 1698 [2024-11-13 14:48:28,670 INFO L226 Difference]: Without dead ends: 1375 [2024-11-13 14:48:28,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:48:28,672 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 260 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:28,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1642 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 14:48:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-13 14:48:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1254. [2024-11-13 14:48:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1121 states have (on average 1.3371989295272078) internal successors, (1499), 1130 states have internal predecessors, (1499), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:48:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1703 transitions. [2024-11-13 14:48:28,949 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1703 transitions. Word has length 113 [2024-11-13 14:48:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:28,950 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1703 transitions. [2024-11-13 14:48:28,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1703 transitions. [2024-11-13 14:48:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:48:28,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:28,953 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:28,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 14:48:28,953 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:28,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1370004851, now seen corresponding path program 1 times [2024-11-13 14:48:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:28,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692916174] [2024-11-13 14:48:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:29,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:29,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692916174] [2024-11-13 14:48:29,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692916174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:29,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:29,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:48:29,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903797849] [2024-11-13 14:48:29,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:29,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:48:29,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:29,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:48:29,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:48:29,188 INFO L87 Difference]: Start difference. First operand 1254 states and 1703 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:29,417 INFO L93 Difference]: Finished difference Result 2544 states and 3455 transitions. [2024-11-13 14:48:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:48:29,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:48:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:29,425 INFO L225 Difference]: With dead ends: 2544 [2024-11-13 14:48:29,425 INFO L226 Difference]: Without dead ends: 1293 [2024-11-13 14:48:29,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:48:29,429 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:29,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:48:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2024-11-13 14:48:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1293. [2024-11-13 14:48:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1160 states have (on average 1.3258620689655172) internal successors, (1538), 1169 states have internal predecessors, (1538), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:48:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1742 transitions. [2024-11-13 14:48:29,660 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1742 transitions. Word has length 113 [2024-11-13 14:48:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:29,661 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1742 transitions. [2024-11-13 14:48:29,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1742 transitions. [2024-11-13 14:48:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:48:29,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:29,664 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:29,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 14:48:29,664 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:29,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1938903037, now seen corresponding path program 1 times [2024-11-13 14:48:29,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:29,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758537916] [2024-11-13 14:48:29,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:30,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:30,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758537916] [2024-11-13 14:48:30,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758537916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:30,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:30,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:48:30,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137384715] [2024-11-13 14:48:30,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:30,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:48:30,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:30,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:48:30,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:48:30,086 INFO L87 Difference]: Start difference. First operand 1293 states and 1742 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:30,532 INFO L93 Difference]: Finished difference Result 2577 states and 3474 transitions. [2024-11-13 14:48:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:48:30,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:48:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:30,540 INFO L225 Difference]: With dead ends: 2577 [2024-11-13 14:48:30,541 INFO L226 Difference]: Without dead ends: 1287 [2024-11-13 14:48:30,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:48:30,546 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 145 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:30,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1009 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:48:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-13 14:48:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1285. [2024-11-13 14:48:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1152 states have (on average 1.3229166666666667) internal successors, (1524), 1161 states have internal predecessors, (1524), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:48:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1728 transitions. [2024-11-13 14:48:30,777 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1728 transitions. Word has length 113 [2024-11-13 14:48:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:30,778 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1728 transitions. [2024-11-13 14:48:30,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1728 transitions. [2024-11-13 14:48:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:48:30,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:30,782 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:30,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 14:48:30,783 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:30,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1010615570, now seen corresponding path program 1 times [2024-11-13 14:48:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:30,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122437010] [2024-11-13 14:48:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:31,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:31,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122437010] [2024-11-13 14:48:31,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122437010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:31,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:31,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:48:31,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074945680] [2024-11-13 14:48:31,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:31,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:48:31,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:48:31,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:48:31,639 INFO L87 Difference]: Start difference. First operand 1285 states and 1728 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:32,786 INFO L93 Difference]: Finished difference Result 2142 states and 2874 transitions. [2024-11-13 14:48:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:48:32,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-13 14:48:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:32,796 INFO L225 Difference]: With dead ends: 2142 [2024-11-13 14:48:32,797 INFO L226 Difference]: Without dead ends: 1441 [2024-11-13 14:48:32,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:48:32,801 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 239 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:32,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1349 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:48:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2024-11-13 14:48:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1285. [2024-11-13 14:48:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1152 states have (on average 1.3211805555555556) internal successors, (1522), 1161 states have internal predecessors, (1522), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:48:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1726 transitions. [2024-11-13 14:48:33,043 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1726 transitions. Word has length 114 [2024-11-13 14:48:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:33,043 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1726 transitions. [2024-11-13 14:48:33,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1726 transitions. [2024-11-13 14:48:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 14:48:33,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:33,047 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:33,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 14:48:33,048 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:33,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1701094263, now seen corresponding path program 1 times [2024-11-13 14:48:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:33,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319836572] [2024-11-13 14:48:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319836572] [2024-11-13 14:48:33,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319836572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:33,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:33,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:48:33,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767833889] [2024-11-13 14:48:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:33,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:48:33,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:48:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:48:33,210 INFO L87 Difference]: Start difference. First operand 1285 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:33,430 INFO L93 Difference]: Finished difference Result 2317 states and 3115 transitions. [2024-11-13 14:48:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:48:33,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-11-13 14:48:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:33,437 INFO L225 Difference]: With dead ends: 2317 [2024-11-13 14:48:33,437 INFO L226 Difference]: Without dead ends: 1031 [2024-11-13 14:48:33,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:48:33,441 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:33,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:48:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-11-13 14:48:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1029. [2024-11-13 14:48:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 918 states have (on average 1.318082788671024) internal successors, (1210), 925 states have internal predecessors, (1210), 86 states have call successors, (86), 24 states have call predecessors, (86), 24 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-13 14:48:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1382 transitions. [2024-11-13 14:48:33,627 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1382 transitions. Word has length 114 [2024-11-13 14:48:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:33,628 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1382 transitions. [2024-11-13 14:48:33,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1382 transitions. [2024-11-13 14:48:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:48:33,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:33,630 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:33,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 14:48:33,631 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:33,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 394610625, now seen corresponding path program 1 times [2024-11-13 14:48:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068493507] [2024-11-13 14:48:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:48:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 14:48:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-13 14:48:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 14:48:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 14:48:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 14:48:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 14:48:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 14:48:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 14:48:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:48:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:48:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 14:48:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:48:34,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:48:34,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068493507] [2024-11-13 14:48:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068493507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:34,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:34,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:48:34,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314380185] [2024-11-13 14:48:34,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:34,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:48:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:48:34,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:48:34,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:48:34,217 INFO L87 Difference]: Start difference. First operand 1029 states and 1382 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:34,846 INFO L93 Difference]: Finished difference Result 1674 states and 2245 transitions. [2024-11-13 14:48:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:48:34,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:48:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:34,855 INFO L225 Difference]: With dead ends: 1674 [2024-11-13 14:48:34,855 INFO L226 Difference]: Without dead ends: 1029 [2024-11-13 14:48:34,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:48:34,858 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 107 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:34,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 623 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:48:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-11-13 14:48:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2024-11-13 14:48:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 918 states have (on average 1.3137254901960784) internal successors, (1206), 925 states have internal predecessors, (1206), 86 states have call successors, (86), 24 states have call predecessors, (86), 24 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-13 14:48:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1378 transitions. [2024-11-13 14:48:35,162 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1378 transitions. Word has length 115 [2024-11-13 14:48:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:35,162 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1378 transitions. [2024-11-13 14:48:35,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:48:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1378 transitions. [2024-11-13 14:48:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:48:35,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:35,166 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:35,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 14:48:35,167 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:35,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:35,167 INFO L85 PathProgramCache]: Analyzing trace with hash -885253053, now seen corresponding path program 1 times [2024-11-13 14:48:35,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:35,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552932398] [2024-11-13 14:48:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:48:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744552968] [2024-11-13 14:48:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:35,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:35,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:48:35,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:48:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:48:35,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:48:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:48:36,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:48:36,300 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:48:36,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:48:36,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:48:36,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 14:48:36,508 INFO L407 BasicCegarLoop]: Path program histogram: [1, 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-13 14:48:36,709 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:48:36,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:48:36 BoogieIcfgContainer [2024-11-13 14:48:36,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:48:36,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:48:36,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:48:36,714 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:48:36,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:47:54" (3/4) ... [2024-11-13 14:48:36,718 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:48:36,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:48:36,720 INFO L158 Benchmark]: Toolchain (without parser) took 43927.12ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 94.0MB in the beginning and 538.4MB in the end (delta: -444.4MB). Peak memory consumption was 191.5MB. Max. memory is 16.1GB. [2024-11-13 14:48:36,720 INFO L158 Benchmark]: CDTParser took 1.74ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:48:36,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.67ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 79.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:48:36,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.87ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 75.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:48:36,721 INFO L158 Benchmark]: Boogie Preprocessor took 102.42ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 71.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:48:36,721 INFO L158 Benchmark]: RCFGBuilder took 1222.55ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 85.8MB in the end (delta: -14.4MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-11-13 14:48:36,722 INFO L158 Benchmark]: TraceAbstraction took 42122.16ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 85.2MB in the beginning and 538.5MB in the end (delta: -453.3MB). Peak memory consumption was 185.0MB. Max. memory is 16.1GB. [2024-11-13 14:48:36,722 INFO L158 Benchmark]: Witness Printer took 5.46ms. Allocated memory is still 755.0MB. Free memory was 538.5MB in the beginning and 538.4MB in the end (delta: 85.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:48:36,724 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.74ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.67ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 79.1MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.87ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 75.6MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 102.42ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 71.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1222.55ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 85.8MB in the end (delta: -14.4MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42122.16ms. Allocated memory was 117.4MB in the beginning and 755.0MB in the end (delta: 637.5MB). Free memory was 85.2MB in the beginning and 538.5MB in the end (delta: -453.3MB). Peak memory consumption was 185.0MB. Max. memory is 16.1GB. * Witness Printer took 5.46ms. Allocated memory is still 755.0MB. Free memory was 538.5MB in the beginning and 538.4MB in the end (delta: 85.8kB). 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 83, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of bitwiseOr at line 104, overapproximation of bitwiseOr at line 69, overapproximation of bitwiseAnd at line 61. 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] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L26-L28] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L26-L28] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L26-L28] float float_Array_0[3] = { 5.8, 0.5, 99.25 }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L32-L34] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L32-L34] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L32-L34] signed short int signed_short_int_Array_0[2] = { 5, 18477 }; [L35] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L36] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L37-L39] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 50, 1, 16 }; [L40] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L41] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L43-L45] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L43-L45] unsigned long int unsigned_long_int_Array_0[1] = { 256 }; [L46] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L47] unsigned char last_1_unsigned_char_Array_0_2_ = 16; [L48] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=0, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L100] EXPR unsigned_char_Array_0[2] [L100] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L101] EXPR unsigned_long_int_Array_0[0] [L101] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L111] RET updateLastVariables() [L112] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L82] float_Array_0[0] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L83] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L84] float_Array_0[1] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[1] [L85] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L85] EXPR float_Array_0[1] [L85] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L86] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L87] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L87] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L87] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L89] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L90] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L92] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L95] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L112] RET updateVariables() [L113] CALL step() [L52] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L52] signed short int stepLocal_3 = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)); [L53] unsigned long int stepLocal_2 = last_1_unsigned_long_int_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, stepLocal_2=256, stepLocal_3=256, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L54] COND FALSE !(last_1_unsigned_long_int_Array_0_0_ > stepLocal_3) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L61] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L61] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) * last_1_unsigned_long_int_Array_0_0_) * ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) [L66] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L66] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) [L68] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L68] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L69] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L69] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L69] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L69] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L69] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L69] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L69] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, stepLocal_1=16, stepLocal_2=256, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L69] unsigned long int stepLocal_0 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))); [L70] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L70] COND FALSE !(stepLocal_0 != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) [L75] (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) = 10.5f VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L104] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L104] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) [L104] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L104] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f)) [L104] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L104] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) * last_1_unsigned_long_int_Array_0_0_) * ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) : 1) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104] EXPR (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) * last_1_unsigned_long_int_Array_0_0_) * ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) : 1) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L104-L105] return (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) ^ (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)))))) != (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) - ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) 10.5f))) && ((last_1_unsigned_long_int_Array_0_0_ > (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) ? ((((last_1_unsigned_char_Array_0_2_ - (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) + (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > last_1_unsigned_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))))) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) & (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) > (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) * last_1_unsigned_long_int_Array_0_0_) * ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) > (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)))) : 1) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_2_=16, last_1_unsigned_long_int_Array_0_0_=256, signed_short_int_Array_0={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={6:2}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:2}, unsigned_long_int_Array_0={8:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.8s, OverallIterations: 25, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5656 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5656 mSDsluCounter, 21116 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16815 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6574 IncrementalHoareTripleChecker+Invalid, 6912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 4301 mSDtfsCounter, 6574 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1087 GetRequests, 862 SyntacticMatches, 1 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1293occurred in iteration=20, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 2918 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 3009 NumberOfCodeBlocks, 3009 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2861 ConstructedInterpolants, 0 QuantifiedInterpolants, 10079 SizeOfPredicates, 8 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 6675/6864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:48:36,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd --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 e68bf11432a02c4ee2bd8f03ee2807d4845705e500d61756e972fae2c63173ed --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:48:39,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:48:40,040 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:48:40,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:48:40,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:48:40,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:48:40,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:48:40,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:48:40,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:48:40,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:48:40,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:48:40,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:48:40,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:48:40,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:48:40,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:48:40,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:48:40,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:48:40,104 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:48:40,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:48:40,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:48:40,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:48:40,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:48:40,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:48:40,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:48:40,105 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:48:40,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:48:40,105 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:48:40,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:48:40,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:48:40,106 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:48:40,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:48:40,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:48:40,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:48:40,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:48:40,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:48:40,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:48:40,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:48:40,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:48:40,108 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:48:40,108 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:48:40,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:48:40,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:48:40,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:48:40,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:48:40,108 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_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd 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 -> e68bf11432a02c4ee2bd8f03ee2807d4845705e500d61756e972fae2c63173ed [2024-11-13 14:48:40,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:48:40,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:48:40,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:48:40,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:48:40,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:48:40,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i Unable to find full path for "g++" [2024-11-13 14:48:42,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:48:43,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:48:43,163 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i [2024-11-13 14:48:43,177 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/data/d3ef2baf7/88fb0920169f45abbff1f5f1a58966c2/FLAG2367a4bf7 [2024-11-13 14:48:43,208 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/data/d3ef2baf7/88fb0920169f45abbff1f5f1a58966c2 [2024-11-13 14:48:43,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:48:43,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:48:43,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:48:43,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:48:43,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:48:43,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50dcb6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43, skipping insertion in model container [2024-11-13 14:48:43,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:48:43,478 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_eae56205-d7a0-4858-9082-ab6bae880bac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i[917,930] [2024-11-13 14:48:43,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:48:43,641 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:48:43,658 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_eae56205-d7a0-4858-9082-ab6bae880bac/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-18.i[917,930] [2024-11-13 14:48:43,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:48:43,764 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:48:43,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43 WrapperNode [2024-11-13 14:48:43,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:48:43,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:48:43,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:48:43,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:48:43,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,855 INFO L138 Inliner]: procedures = 36, calls = 143, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2024-11-13 14:48:43,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:48:43,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:48:43,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:48:43,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:48:43,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,927 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 29, 22, 46, 10]. 40 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 2, 3, 1]. The 13 writes are split as follows [0, 1, 4, 2, 4, 2]. [2024-11-13 14:48:43,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:48:43,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:48:43,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:48:43,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:48:43,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (1/1) ... [2024-11-13 14:48:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:48:44,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:44,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:48:44,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:48:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:48:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-13 14:48:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-13 14:48:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-13 14:48:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-13 14:48:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-13 14:48:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-13 14:48:44,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-13 14:48:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-13 14:48:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-13 14:48:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-13 14:48:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-13 14:48:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-13 14:48:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:48:44,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-13 14:48:44,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-13 14:48:44,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-13 14:48:44,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-13 14:48:44,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-13 14:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-13 14:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-13 14:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-13 14:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-13 14:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-13 14:48:44,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-13 14:48:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-13 14:48:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-13 14:48:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-13 14:48:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-13 14:48:44,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-13 14:48:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-13 14:48:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-13 14:48:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-13 14:48:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-13 14:48:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-13 14:48:44,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-13 14:48:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-13 14:48:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-13 14:48:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-13 14:48:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-13 14:48:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-13 14:48:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-13 14:48:44,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-13 14:48:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-13 14:48:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-13 14:48:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-13 14:48:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-13 14:48:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-13 14:48:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-13 14:48:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-13 14:48:44,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:48:44,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:48:44,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-13 14:48:44,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-13 14:48:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-13 14:48:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-13 14:48:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-13 14:48:44,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-13 14:48:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-13 14:48:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-13 14:48:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-13 14:48:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-13 14:48:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-13 14:48:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-13 14:48:44,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-13 14:48:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-13 14:48:44,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-13 14:48:44,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:48:44,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:48:45,384 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-13 14:48:45,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:48:45,404 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:48:45,406 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:48:45,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:48:45 BoogieIcfgContainer [2024-11-13 14:48:45,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:48:45,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:48:45,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:48:45,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:48:45,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:48:43" (1/3) ... [2024-11-13 14:48:45,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd3c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:48:45, skipping insertion in model container [2024-11-13 14:48:45,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:43" (2/3) ... [2024-11-13 14:48:45,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd3c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:48:45, skipping insertion in model container [2024-11-13 14:48:45,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:48:45" (3/3) ... [2024-11-13 14:48:45,427 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-18.i [2024-11-13 14:48:45,445 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:48:45,447 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-18.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:48:45,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:48:45,534 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;@5149739a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:48:45,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:48:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:48:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:48:45,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:45,560 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:45,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:45,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1123652284, now seen corresponding path program 1 times [2024-11-13 14:48:45,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:48:45,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561910594] [2024-11-13 14:48:45,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:45,581 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-13 14:48:45,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:48:45,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:45,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:45,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:48:46,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:48:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-13 14:48:46,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:48:46,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:48:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561910594] [2024-11-13 14:48:46,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561910594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:48:46,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:48:46,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:48:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918794941] [2024-11-13 14:48:46,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:48:46,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:48:46,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:48:46,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:48:46,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:48:46,087 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:48:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:46,130 INFO L93 Difference]: Finished difference Result 177 states and 274 transitions. [2024-11-13 14:48:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:48:46,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-13 14:48:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:46,137 INFO L225 Difference]: With dead ends: 177 [2024-11-13 14:48:46,137 INFO L226 Difference]: Without dead ends: 88 [2024-11-13 14:48:46,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-13 14:48:46,144 INFO L432 NwaCegarLoop]: 127 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, 127 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-13 14:48:46,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:48:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-13 14:48:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-13 14:48:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:48:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2024-11-13 14:48:46,200 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 103 [2024-11-13 14:48:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:46,200 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2024-11-13 14:48:46,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-13 14:48:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2024-11-13 14:48:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:48:46,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:46,205 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:46,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:46,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:46,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:46,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 743178480, now seen corresponding path program 1 times [2024-11-13 14:48:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:48:46,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147056445] [2024-11-13 14:48:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:46,408 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-13 14:48:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:48:46,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:46,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:46,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:48:46,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:48:48,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 14:48:48,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:48:48,125 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 17 treesize of output 9 [2024-11-13 14:48:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:48:48,203 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:48:48,486 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:48:48,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147056445] [2024-11-13 14:48:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147056445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:48:48,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995544237] [2024-11-13 14:48:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:48,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:48,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:48,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:48:48,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:48:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:48,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:48:48,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:48:49,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 14:48:49,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:48:49,854 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 17 treesize of output 9 [2024-11-13 14:48:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:48:49,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:48:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995544237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:48:49,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:48:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-13 14:48:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315178666] [2024-11-13 14:48:49,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:48:49,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:48:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:48:49,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:48:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:48:49,963 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:48:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:53,146 INFO L93 Difference]: Finished difference Result 270 states and 385 transitions. [2024-11-13 14:48:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 14:48:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-11-13 14:48:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:53,155 INFO L225 Difference]: With dead ends: 270 [2024-11-13 14:48:53,157 INFO L226 Difference]: Without dead ends: 185 [2024-11-13 14:48:53,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2024-11-13 14:48:53,159 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 377 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:53,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 721 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:48:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-13 14:48:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2024-11-13 14:48:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.38) internal successors, (207), 150 states have internal predecessors, (207), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:48:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 255 transitions. [2024-11-13 14:48:53,223 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 255 transitions. Word has length 103 [2024-11-13 14:48:53,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:53,224 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 255 transitions. [2024-11-13 14:48:53,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:48:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 255 transitions. [2024-11-13 14:48:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 14:48:53,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:53,229 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:53,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:48:53,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:53,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:53,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:53,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash -536685198, now seen corresponding path program 1 times [2024-11-13 14:48:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:48:53,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272536775] [2024-11-13 14:48:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:53,631 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-13 14:48:53,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:48:53,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:53,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:54,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:48:54,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:48:54,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 14:48:54,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:48:54,933 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 17 treesize of output 9 [2024-11-13 14:48:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:48:55,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:48:55,351 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:48:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272536775] [2024-11-13 14:48:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272536775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:48:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085764959] [2024-11-13 14:48:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:55,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:55,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:55,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:48:55,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:48:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:48:55,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:48:55,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:48:56,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 14:48:56,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:48:56,333 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 17 treesize of output 9 [2024-11-13 14:48:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:48:56,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:48:56,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085764959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:48:56,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:48:56,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-13 14:48:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669770323] [2024-11-13 14:48:56,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:48:56,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:48:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:48:56,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:48:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:48:56,484 INFO L87 Difference]: Start difference. First operand 179 states and 255 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:48:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:48:59,432 INFO L93 Difference]: Finished difference Result 274 states and 386 transitions. [2024-11-13 14:48:59,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 14:48:59,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-11-13 14:48:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:48:59,439 INFO L225 Difference]: With dead ends: 274 [2024-11-13 14:48:59,439 INFO L226 Difference]: Without dead ends: 185 [2024-11-13 14:48:59,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:48:59,449 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 373 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:48:59,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 856 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 14:48:59,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-13 14:48:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2024-11-13 14:48:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.3733333333333333) internal successors, (206), 150 states have internal predecessors, (206), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:48:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2024-11-13 14:48:59,522 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 103 [2024-11-13 14:48:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:48:59,523 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2024-11-13 14:48:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:48:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2024-11-13 14:48:59,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:48:59,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:59,532 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:48:59,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:59,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:48:59,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:48:59,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:59,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1706334860, now seen corresponding path program 1 times [2024-11-13 14:48:59,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:48:59,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731371164] [2024-11-13 14:48:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:59,934 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-13 14:48:59,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:48:59,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:48:59,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:00,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:49:00,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:00,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 14:49:00,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:49:01,016 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 17 treesize of output 9 [2024-11-13 14:49:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:49:01,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:01,254 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:01,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731371164] [2024-11-13 14:49:01,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731371164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:01,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880317177] [2024-11-13 14:49:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:01,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:01,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:01,258 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:01,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:49:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:01,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 14:49:01,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:02,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-13 14:49:02,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-13 14:49:02,208 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 17 treesize of output 9 [2024-11-13 14:49:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:49:02,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880317177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:02,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:49:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-13 14:49:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339236461] [2024-11-13 14:49:02,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:02,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:49:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:02,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:49:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:49:02,294 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:49:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:04,395 INFO L93 Difference]: Finished difference Result 274 states and 384 transitions. [2024-11-13 14:49:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 14:49:04,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2024-11-13 14:49:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:04,399 INFO L225 Difference]: With dead ends: 274 [2024-11-13 14:49:04,399 INFO L226 Difference]: Without dead ends: 185 [2024-11-13 14:49:04,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2024-11-13 14:49:04,401 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 366 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:04,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 720 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:49:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-13 14:49:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2024-11-13 14:49:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:49:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 253 transitions. [2024-11-13 14:49:04,438 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 253 transitions. Word has length 104 [2024-11-13 14:49:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:04,439 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 253 transitions. [2024-11-13 14:49:04,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:49:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 253 transitions. [2024-11-13 14:49:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:49:04,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:04,442 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:04,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:04,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:49:04,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:04,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:04,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1887567858, now seen corresponding path program 1 times [2024-11-13 14:49:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223103517] [2024-11-13 14:49:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:04,844 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-13 14:49:04,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:04,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:04,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:05,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 14:49:05,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:05,331 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 30 treesize of output 22 [2024-11-13 14:49:05,378 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 35 treesize of output 19 [2024-11-13 14:49:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:05,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:05,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:05,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223103517] [2024-11-13 14:49:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223103517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:05,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:49:05,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470698278] [2024-11-13 14:49:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:05,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:49:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:05,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:49:05,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:49:05,439 INFO L87 Difference]: Start difference. First operand 179 states and 253 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:06,675 INFO L93 Difference]: Finished difference Result 363 states and 513 transitions. [2024-11-13 14:49:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:49:06,676 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-13 14:49:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:06,678 INFO L225 Difference]: With dead ends: 363 [2024-11-13 14:49:06,678 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 14:49:06,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:49:06,680 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 126 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:06,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 542 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:49:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 14:49:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2024-11-13 14:49:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 154 states have internal predecessors, (208), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:49:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 256 transitions. [2024-11-13 14:49:06,712 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 256 transitions. Word has length 104 [2024-11-13 14:49:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:06,712 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 256 transitions. [2024-11-13 14:49:06,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 256 transitions. [2024-11-13 14:49:06,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:49:06,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:06,715 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:06,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:49:06,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:06,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:06,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1617629994, now seen corresponding path program 1 times [2024-11-13 14:49:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995058863] [2024-11-13 14:49:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:06,917 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-13 14:49:06,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:06,922 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:06,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:07,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:49:07,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:07,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:07,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:07,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995058863] [2024-11-13 14:49:07,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995058863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:07,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:07,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:49:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857961104] [2024-11-13 14:49:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:07,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:49:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:07,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:49:07,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:07,570 INFO L87 Difference]: Start difference. First operand 183 states and 256 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:07,829 INFO L93 Difference]: Finished difference Result 363 states and 507 transitions. [2024-11-13 14:49:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:07,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-13 14:49:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:07,832 INFO L225 Difference]: With dead ends: 363 [2024-11-13 14:49:07,833 INFO L226 Difference]: Without dead ends: 183 [2024-11-13 14:49:07,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:07,835 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 67 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:07,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 433 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:49:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-13 14:49:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-13 14:49:07,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 152 states have internal predecessors, (204), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:49:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 252 transitions. [2024-11-13 14:49:07,865 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 252 transitions. Word has length 105 [2024-11-13 14:49:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:07,868 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 252 transitions. [2024-11-13 14:49:07,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 252 transitions. [2024-11-13 14:49:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 14:49:07,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:07,870 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:07,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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)] Ended with exit code 0 [2024-11-13 14:49:08,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:08,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:08,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:08,073 INFO L85 PathProgramCache]: Analyzing trace with hash 549373504, now seen corresponding path program 1 times [2024-11-13 14:49:08,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:08,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975150467] [2024-11-13 14:49:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:08,074 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-13 14:49:08,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:08,076 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:08,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:08,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:49:08,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:08,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:08,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:08,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975150467] [2024-11-13 14:49:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975150467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:08,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:49:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894435937] [2024-11-13 14:49:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:08,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:49:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:49:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:08,417 INFO L87 Difference]: Start difference. First operand 181 states and 252 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:08,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:08,494 INFO L93 Difference]: Finished difference Result 365 states and 509 transitions. [2024-11-13 14:49:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:49:08,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-13 14:49:08,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:08,497 INFO L225 Difference]: With dead ends: 365 [2024-11-13 14:49:08,497 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 14:49:08,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:08,499 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:08,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 14:49:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-13 14:49:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 158 states have internal predecessors, (210), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-13 14:49:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 258 transitions. [2024-11-13 14:49:08,527 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 258 transitions. Word has length 106 [2024-11-13 14:49:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:08,528 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 258 transitions. [2024-11-13 14:49:08,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 258 transitions. [2024-11-13 14:49:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-13 14:49:08,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:08,530 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:08,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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)] Forceful destruction successful, exit code 0 [2024-11-13 14:49:08,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:08,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1250439278, now seen corresponding path program 1 times [2024-11-13 14:49:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376653552] [2024-11-13 14:49:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:08,732 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-13 14:49:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:08,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:08,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (12)] Waiting until timeout for monitored process [2024-11-13 14:49:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:09,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:49:09,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:09,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:09,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376653552] [2024-11-13 14:49:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376653552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:09,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:09,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:49:09,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092844510] [2024-11-13 14:49:09,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:09,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:49:09,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:09,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:49:09,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:09,391 INFO L87 Difference]: Start difference. First operand 187 states and 258 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:09,788 INFO L93 Difference]: Finished difference Result 371 states and 511 transitions. [2024-11-13 14:49:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2024-11-13 14:49:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:09,795 INFO L225 Difference]: With dead ends: 371 [2024-11-13 14:49:09,795 INFO L226 Difference]: Without dead ends: 187 [2024-11-13 14:49:09,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:09,799 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 60 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:09,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 429 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:49:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-13 14:49:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 95. [2024-11-13 14:49:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:49:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-11-13 14:49:09,844 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 106 [2024-11-13 14:49:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:09,845 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-11-13 14:49:09,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-11-13 14:49:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:49:09,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:09,846 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:09,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (12)] Ended with exit code 0 [2024-11-13 14:49:10,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:10,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:10,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash -27850645, now seen corresponding path program 1 times [2024-11-13 14:49:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:10,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124812142] [2024-11-13 14:49:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:10,048 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-13 14:49:10,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:10,050 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:10,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (13)] Waiting until timeout for monitored process [2024-11-13 14:49:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:10,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:49:10,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:10,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:10,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124812142] [2024-11-13 14:49:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124812142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:10,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:49:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666065281] [2024-11-13 14:49:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:10,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:49:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:10,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:49:10,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:10,369 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:10,438 INFO L93 Difference]: Finished difference Result 190 states and 259 transitions. [2024-11-13 14:49:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:49:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-13 14:49:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:10,440 INFO L225 Difference]: With dead ends: 190 [2024-11-13 14:49:10,440 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 14:49:10,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:10,442 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:10,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:49:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 14:49:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-13 14:49:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-13 14:49:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2024-11-13 14:49:10,461 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 108 [2024-11-13 14:49:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:10,462 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2024-11-13 14:49:10,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2024-11-13 14:49:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 14:49:10,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:10,464 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:10,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (13)] Forceful destruction successful, exit code 0 [2024-11-13 14:49:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:10,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash -566580379, now seen corresponding path program 1 times [2024-11-13 14:49:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:10,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983249522] [2024-11-13 14:49:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:10,665 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-13 14:49:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:10,667 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:10,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (14)] Waiting until timeout for monitored process [2024-11-13 14:49:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:11,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:49:11,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:11,641 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 45 treesize of output 29 [2024-11-13 14:49:11,647 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 25 treesize of output 17 [2024-11-13 14:49:11,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 14:49:11,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:12,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:12,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983249522] [2024-11-13 14:49:12,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983249522] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:12,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:49:12,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2024-11-13 14:49:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953144318] [2024-11-13 14:49:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:12,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:49:12,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:49:12,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:49:12,106 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:12,811 INFO L93 Difference]: Finished difference Result 247 states and 332 transitions. [2024-11-13 14:49:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:49:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2024-11-13 14:49:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:12,815 INFO L225 Difference]: With dead ends: 247 [2024-11-13 14:49:12,816 INFO L226 Difference]: Without dead ends: 152 [2024-11-13 14:49:12,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:49:12,818 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 66 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:12,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 456 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:49:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-13 14:49:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2024-11-13 14:49:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-13 14:49:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 200 transitions. [2024-11-13 14:49:12,844 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 200 transitions. Word has length 108 [2024-11-13 14:49:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:12,844 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 200 transitions. [2024-11-13 14:49:12,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 200 transitions. [2024-11-13 14:49:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:49:12,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:12,847 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:12,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (14)] Ended with exit code 0 [2024-11-13 14:49:13,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:13,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:13,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:13,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1692836039, now seen corresponding path program 1 times [2024-11-13 14:49:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042870009] [2024-11-13 14:49:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:13,050 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-13 14:49:13,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:13,051 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:13,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (15)] Waiting until timeout for monitored process [2024-11-13 14:49:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:13,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:49:13,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:13,802 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 19 treesize of output 11 [2024-11-13 14:49:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:15,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:15,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042870009] [2024-11-13 14:49:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042870009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:15,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:15,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535941983] [2024-11-13 14:49:15,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:15,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:49:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:15,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:49:15,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:49:15,681 INFO L87 Difference]: Start difference. First operand 149 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:18,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:20,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:25,954 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 [0] [2024-11-13 14:49:29,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:31,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:34,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:36,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:37,253 INFO L93 Difference]: Finished difference Result 682 states and 906 transitions. [2024-11-13 14:49:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:49:37,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-13 14:49:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:37,264 INFO L225 Difference]: With dead ends: 682 [2024-11-13 14:49:37,264 INFO L226 Difference]: Without dead ends: 536 [2024-11-13 14:49:37,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:49:37,266 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 303 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:37,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 747 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 279 Invalid, 2 Unknown, 0 Unchecked, 21.4s Time] [2024-11-13 14:49:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-13 14:49:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 353. [2024-11-13 14:49:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 314 states have (on average 1.2898089171974523) internal successors, (405), 316 states have internal predecessors, (405), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 14:49:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 469 transitions. [2024-11-13 14:49:37,315 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 469 transitions. Word has length 110 [2024-11-13 14:49:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:37,316 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 469 transitions. [2024-11-13 14:49:37,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2024-11-13 14:49:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:49:37,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:37,318 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:37,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (15)] Ended with exit code 0 [2024-11-13 14:49:37,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:37,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:37,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash 777627383, now seen corresponding path program 1 times [2024-11-13 14:49:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:37,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250008771] [2024-11-13 14:49:37,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:37,520 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-13 14:49:37,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:37,522 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:37,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (16)] Waiting until timeout for monitored process [2024-11-13 14:49:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:37,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:49:37,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:38,256 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 17 treesize of output 13 [2024-11-13 14:49:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 14:49:38,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:38,660 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:38,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250008771] [2024-11-13 14:49:38,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250008771] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:38,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:49:38,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-11-13 14:49:38,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379568993] [2024-11-13 14:49:38,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:38,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:49:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:38,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:49:38,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:49:38,661 INFO L87 Difference]: Start difference. First operand 353 states and 469 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:39,139 INFO L93 Difference]: Finished difference Result 480 states and 635 transitions. [2024-11-13 14:49:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:49:39,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-13 14:49:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:39,143 INFO L225 Difference]: With dead ends: 480 [2024-11-13 14:49:39,143 INFO L226 Difference]: Without dead ends: 478 [2024-11-13 14:49:39,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:49:39,145 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 67 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:39,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 791 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:49:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-13 14:49:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 390. [2024-11-13 14:49:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 351 states have (on average 1.2877492877492878) internal successors, (452), 353 states have internal predecessors, (452), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 14:49:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 516 transitions. [2024-11-13 14:49:39,208 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 516 transitions. Word has length 110 [2024-11-13 14:49:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:39,209 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 516 transitions. [2024-11-13 14:49:39,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 516 transitions. [2024-11-13 14:49:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 14:49:39,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:39,211 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:39,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (16)] Ended with exit code 0 [2024-11-13 14:49:39,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:39,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:39,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2129308162, now seen corresponding path program 1 times [2024-11-13 14:49:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404927829] [2024-11-13 14:49:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:39,413 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-13 14:49:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:39,416 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:39,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (17)] Waiting until timeout for monitored process [2024-11-13 14:49:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:39,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:49:39,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:40,406 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 18 treesize of output 10 [2024-11-13 14:49:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:49:40,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:40,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:40,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404927829] [2024-11-13 14:49:40,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404927829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:40,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369720592] [2024-11-13 14:49:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:40,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:40,678 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:40,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 14:49:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:40,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 14:49:40,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:43,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 14:49:43,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:49:43,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-11-13 14:49:44,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:49:44,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 25 [2024-11-13 14:49:44,656 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 18 treesize of output 10 [2024-11-13 14:49:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 185 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-13 14:49:44,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369720592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:46,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:49:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-13 14:49:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013632303] [2024-11-13 14:49:46,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:46,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:49:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:46,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:49:46,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:49:46,171 INFO L87 Difference]: Start difference. First operand 390 states and 516 transitions. Second operand has 17 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-13 14:49:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:50,278 INFO L93 Difference]: Finished difference Result 887 states and 1141 transitions. [2024-11-13 14:49:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 14:49:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) Word has length 110 [2024-11-13 14:49:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:50,281 INFO L225 Difference]: With dead ends: 887 [2024-11-13 14:49:50,281 INFO L226 Difference]: Without dead ends: 500 [2024-11-13 14:49:50,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=450, Invalid=1806, Unknown=0, NotChecked=0, Total=2256 [2024-11-13 14:49:50,283 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 423 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:50,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 562 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 14:49:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-13 14:49:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 472. [2024-11-13 14:49:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.2088452088452089) internal successors, (492), 407 states have internal predecessors, (492), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:49:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 588 transitions. [2024-11-13 14:49:50,363 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 588 transitions. Word has length 110 [2024-11-13 14:49:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:50,364 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 588 transitions. [2024-11-13 14:49:50,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 8 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-13 14:49:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 588 transitions. [2024-11-13 14:49:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 14:49:50,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:50,367 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:50,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (17)] Ended with exit code 0 [2024-11-13 14:49:50,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-13 14:49:50,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:50,768 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1032774205, now seen corresponding path program 1 times [2024-11-13 14:49:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:50,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279586438] [2024-11-13 14:49:50,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:50,769 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-13 14:49:50,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:50,770 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:50,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (19)] Waiting until timeout for monitored process [2024-11-13 14:49:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:51,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:49:51,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:51,159 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 21 treesize of output 9 [2024-11-13 14:49:52,587 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:49:52,587 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 35 treesize of output 28 [2024-11-13 14:49:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:49:52,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:52,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279586438] [2024-11-13 14:49:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279586438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488124835] [2024-11-13 14:49:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:52,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:52,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:52,968 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:49:52,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 14:49:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:53,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 14:49:53,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:54,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:49:55,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:49:55,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-13 14:49:55,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:49:55,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:49:55,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2024-11-13 14:49:55,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:49:55,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 79 treesize of output 39 [2024-11-13 14:49:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 24 proven. 104 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-13 14:49:56,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:56,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488124835] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:49:56,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:49:56,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 12] total 25 [2024-11-13 14:49:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733296974] [2024-11-13 14:49:56,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:56,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:49:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:49:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:49:56,629 INFO L87 Difference]: Start difference. First operand 472 states and 588 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:57,225 INFO L93 Difference]: Finished difference Result 912 states and 1144 transitions. [2024-11-13 14:49:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:49:57,226 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-13 14:49:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:57,230 INFO L225 Difference]: With dead ends: 912 [2024-11-13 14:49:57,230 INFO L226 Difference]: Without dead ends: 669 [2024-11-13 14:49:57,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-13 14:49:57,232 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 78 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:57,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 944 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:49:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-13 14:49:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 656. [2024-11-13 14:49:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 569 states have (on average 1.2179261862917399) internal successors, (693), 571 states have internal predecessors, (693), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:49:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 821 transitions. [2024-11-13 14:49:57,350 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 821 transitions. Word has length 111 [2024-11-13 14:49:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:57,351 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 821 transitions. [2024-11-13 14:49:57,351 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:49:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 821 transitions. [2024-11-13 14:49:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 14:49:57,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:57,352 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:49:57,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-13 14:49:57,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (19)] Forceful destruction successful, exit code 0 [2024-11-13 14:49:57,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:57,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:57,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1199996797, now seen corresponding path program 1 times [2024-11-13 14:49:57,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:57,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504853406] [2024-11-13 14:49:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:57,754 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-13 14:49:57,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:57,756 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:57,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (21)] Waiting until timeout for monitored process [2024-11-13 14:49:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:58,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:49:58,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:58,899 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 44 treesize of output 36 [2024-11-13 14:49:58,943 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:49:58,944 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 64 treesize of output 45 [2024-11-13 14:49:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:49:59,082 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:59,082 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:59,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504853406] [2024-11-13 14:49:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504853406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:59,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:49:59,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236793858] [2024-11-13 14:49:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:59,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:49:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:59,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:49:59,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:49:59,084 INFO L87 Difference]: Start difference. First operand 656 states and 821 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:01,383 INFO L93 Difference]: Finished difference Result 1543 states and 1919 transitions. [2024-11-13 14:50:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:50:01,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-11-13 14:50:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:01,391 INFO L225 Difference]: With dead ends: 1543 [2024-11-13 14:50:01,392 INFO L226 Difference]: Without dead ends: 890 [2024-11-13 14:50:01,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:50:01,394 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 189 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:01,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 690 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-13 14:50:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-13 14:50:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 739. [2024-11-13 14:50:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 652 states have (on average 1.1978527607361964) internal successors, (781), 654 states have internal predecessors, (781), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:50:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 909 transitions. [2024-11-13 14:50:01,519 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 909 transitions. Word has length 112 [2024-11-13 14:50:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:01,519 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 909 transitions. [2024-11-13 14:50:01,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 909 transitions. [2024-11-13 14:50:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:50:01,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:01,521 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:01,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (21)] Ended with exit code 0 [2024-11-13 14:50:01,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:01,725 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:01,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -398439307, now seen corresponding path program 1 times [2024-11-13 14:50:01,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:01,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322008688] [2024-11-13 14:50:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:01,726 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-13 14:50:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:01,731 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:01,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (22)] Waiting until timeout for monitored process [2024-11-13 14:50:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:02,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:50:02,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:02,515 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 17 treesize of output 13 [2024-11-13 14:50:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-13 14:50:02,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:02,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322008688] [2024-11-13 14:50:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322008688] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:02,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:02,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-11-13 14:50:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778738904] [2024-11-13 14:50:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:02,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:50:02,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:50:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:50:02,962 INFO L87 Difference]: Start difference. First operand 739 states and 909 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:03,581 INFO L93 Difference]: Finished difference Result 878 states and 1091 transitions. [2024-11-13 14:50:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:50:03,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:50:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:03,589 INFO L225 Difference]: With dead ends: 878 [2024-11-13 14:50:03,589 INFO L226 Difference]: Without dead ends: 876 [2024-11-13 14:50:03,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:50:03,591 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 55 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:03,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 861 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:50:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-13 14:50:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 763. [2024-11-13 14:50:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 676 states have (on average 1.1997041420118344) internal successors, (811), 678 states have internal predecessors, (811), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:50:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 939 transitions. [2024-11-13 14:50:03,711 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 939 transitions. Word has length 113 [2024-11-13 14:50:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:03,711 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 939 transitions. [2024-11-13 14:50:03,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 939 transitions. [2024-11-13 14:50:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:50:03,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:03,713 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:03,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (22)] Ended with exit code 0 [2024-11-13 14:50:03,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:03,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:03,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash 695889592, now seen corresponding path program 1 times [2024-11-13 14:50:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396692979] [2024-11-13 14:50:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:03,915 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-13 14:50:03,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:03,917 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:03,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (23)] Waiting until timeout for monitored process [2024-11-13 14:50:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:04,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:50:04,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:04,388 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 21 treesize of output 9 [2024-11-13 14:50:05,814 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:50:05,814 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 35 treesize of output 28 [2024-11-13 14:50:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:50:05,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:06,178 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396692979] [2024-11-13 14:50:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396692979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934035454] [2024-11-13 14:50:06,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:06,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:50:06,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:06,180 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:50:06,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 14:50:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:06,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 14:50:06,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:07,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:50:07,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-13 14:50:07,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:07,800 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 35 treesize of output 15 [2024-11-13 14:50:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 14:50:08,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:08,511 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 58 treesize of output 42 [2024-11-13 14:50:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934035454] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:08,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:50:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 11] total 26 [2024-11-13 14:50:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536171214] [2024-11-13 14:50:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:08,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:50:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:50:08,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:50:08,590 INFO L87 Difference]: Start difference. First operand 763 states and 939 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:09,504 INFO L93 Difference]: Finished difference Result 1295 states and 1598 transitions. [2024-11-13 14:50:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:50:09,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:50:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:09,508 INFO L225 Difference]: With dead ends: 1295 [2024-11-13 14:50:09,508 INFO L226 Difference]: Without dead ends: 787 [2024-11-13 14:50:09,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=1090, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 14:50:09,510 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 81 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:09,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1235 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:50:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-13 14:50:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 767. [2024-11-13 14:50:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 680 states have (on average 1.1985294117647058) internal successors, (815), 682 states have internal predecessors, (815), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:50:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 943 transitions. [2024-11-13 14:50:09,617 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 943 transitions. Word has length 113 [2024-11-13 14:50:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:09,617 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 943 transitions. [2024-11-13 14:50:09,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 943 transitions. [2024-11-13 14:50:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:50:09,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:09,619 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:09,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-13 14:50:09,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (23)] Ended with exit code 0 [2024-11-13 14:50:10,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:10,022 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:10,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash 302862582, now seen corresponding path program 1 times [2024-11-13 14:50:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:10,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132062595] [2024-11-13 14:50:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:10,023 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-13 14:50:10,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:10,026 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:10,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (25)] Waiting until timeout for monitored process [2024-11-13 14:50:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:10,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:50:10,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:10,462 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 21 treesize of output 9 [2024-11-13 14:50:11,869 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:50:11,869 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 35 treesize of output 28 [2024-11-13 14:50:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:50:11,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:12,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:12,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132062595] [2024-11-13 14:50:12,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132062595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:12,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573235515] [2024-11-13 14:50:12,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:12,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:50:12,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:12,248 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:50:12,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 14:50:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:12,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:50:12,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:12,592 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 21 treesize of output 9 [2024-11-13 14:50:13,795 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:50:13,795 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 35 treesize of output 28 [2024-11-13 14:50:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:50:13,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:13,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573235515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:13,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:50:13,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-13 14:50:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032656427] [2024-11-13 14:50:13,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:50:13,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:50:13,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:13,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:50:13,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:50:13,961 INFO L87 Difference]: Start difference. First operand 767 states and 943 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:50:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:16,908 INFO L93 Difference]: Finished difference Result 1410 states and 1735 transitions. [2024-11-13 14:50:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:50:16,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2024-11-13 14:50:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:16,919 INFO L225 Difference]: With dead ends: 1410 [2024-11-13 14:50:16,919 INFO L226 Difference]: Without dead ends: 898 [2024-11-13 14:50:16,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2024-11-13 14:50:16,921 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 310 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:16,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 614 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:50:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-11-13 14:50:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 768. [2024-11-13 14:50:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 681 states have (on average 1.198237885462555) internal successors, (816), 683 states have internal predecessors, (816), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:50:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 944 transitions. [2024-11-13 14:50:17,052 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 944 transitions. Word has length 113 [2024-11-13 14:50:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:17,053 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 944 transitions. [2024-11-13 14:50:17,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:50:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 944 transitions. [2024-11-13 14:50:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:50:17,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:17,056 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:17,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (25)] Forceful destruction successful, exit code 0 [2024-11-13 14:50:17,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-13 14:50:17,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:50:17,457 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1777839746, now seen corresponding path program 1 times [2024-11-13 14:50:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64036296] [2024-11-13 14:50:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:17,458 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-13 14:50:17,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:17,460 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:17,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (27)] Waiting until timeout for monitored process [2024-11-13 14:50:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:17,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:50:17,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:17,951 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 21 treesize of output 9 [2024-11-13 14:50:19,956 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:50:19,956 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 35 treesize of output 28 [2024-11-13 14:50:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:50:20,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:20,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64036296] [2024-11-13 14:50:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64036296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208155963] [2024-11-13 14:50:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:20,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:50:20,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:20,540 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:50:20,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-13 14:50:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:20,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 14:50:20,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:22,197 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 12 treesize of output 8 [2024-11-13 14:50:23,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:50:23,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-11-13 14:50:23,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:50:23,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:50:23,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-13 14:50:24,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:24,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 77 treesize of output 41 [2024-11-13 14:50:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 64 proven. 104 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-13 14:50:24,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:25,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208155963] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:25,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:50:25,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 16] total 31 [2024-11-13 14:50:25,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717406772] [2024-11-13 14:50:25,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:25,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:50:25,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:25,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:50:25,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 14:50:25,363 INFO L87 Difference]: Start difference. First operand 768 states and 944 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:26,260 INFO L93 Difference]: Finished difference Result 1532 states and 1889 transitions. [2024-11-13 14:50:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 14:50:26,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-13 14:50:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:26,266 INFO L225 Difference]: With dead ends: 1532 [2024-11-13 14:50:26,266 INFO L226 Difference]: Without dead ends: 1020 [2024-11-13 14:50:26,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=120, Invalid=1362, Unknown=0, NotChecked=0, Total=1482 [2024-11-13 14:50:26,269 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 78 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:26,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1086 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:50:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-11-13 14:50:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 842. [2024-11-13 14:50:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 755 states have (on average 1.2026490066225166) internal successors, (908), 757 states have internal predecessors, (908), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:50:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1036 transitions. [2024-11-13 14:50:26,419 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1036 transitions. Word has length 113 [2024-11-13 14:50:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:26,420 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1036 transitions. [2024-11-13 14:50:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1036 transitions. [2024-11-13 14:50:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 14:50:26,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:26,422 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:26,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-13 14:50:26,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (27)] Forceful destruction successful, exit code 0 [2024-11-13 14:50:26,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:26,823 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:26,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash -593899516, now seen corresponding path program 1 times [2024-11-13 14:50:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473380512] [2024-11-13 14:50:26,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:26,824 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-13 14:50:26,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:26,829 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:26,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (29)] Waiting until timeout for monitored process [2024-11-13 14:50:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:27,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:50:27,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:27,363 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 21 treesize of output 9 [2024-11-13 14:50:29,302 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:50:29,303 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 35 treesize of output 28 [2024-11-13 14:50:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:50:29,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:29,958 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473380512] [2024-11-13 14:50:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473380512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:29,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918160093] [2024-11-13 14:50:29,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:29,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:50:29,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:29,960 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:50:29,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-13 14:50:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:30,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:50:30,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:30,334 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 21 treesize of output 9 [2024-11-13 14:50:31,947 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:50:31,947 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 35 treesize of output 28 [2024-11-13 14:50:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 159 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-13 14:50:32,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:32,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918160093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:32,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:50:32,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-13 14:50:32,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21077232] [2024-11-13 14:50:32,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:50:32,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:50:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:32,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:50:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:50:32,259 INFO L87 Difference]: Start difference. First operand 842 states and 1036 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:50:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:36,526 INFO L93 Difference]: Finished difference Result 1690 states and 2081 transitions. [2024-11-13 14:50:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:50:36,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2024-11-13 14:50:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:36,530 INFO L225 Difference]: With dead ends: 1690 [2024-11-13 14:50:36,530 INFO L226 Difference]: Without dead ends: 1104 [2024-11-13 14:50:36,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:50:36,532 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 312 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:36,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1012 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-13 14:50:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-13 14:50:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 943. [2024-11-13 14:50:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 856 states have (on average 1.1939252336448598) internal successors, (1022), 858 states have internal predecessors, (1022), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:50:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1150 transitions. [2024-11-13 14:50:36,681 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1150 transitions. Word has length 113 [2024-11-13 14:50:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:36,682 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1150 transitions. [2024-11-13 14:50:36,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-13 14:50:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1150 transitions. [2024-11-13 14:50:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:36,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:36,684 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:36,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-13 14:50:36,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (29)] Ended with exit code 0 [2024-11-13 14:50:37,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:37,085 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:37,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1845404113, now seen corresponding path program 1 times [2024-11-13 14:50:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:37,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22601378] [2024-11-13 14:50:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:37,086 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-13 14:50:37,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:37,089 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:37,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (31)] Waiting until timeout for monitored process [2024-11-13 14:50:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:37,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:50:37,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-13 14:50:39,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:40,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:40,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22601378] [2024-11-13 14:50:40,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22601378] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:40,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:40,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-13 14:50:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575525891] [2024-11-13 14:50:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:40,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:40,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:40,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:40,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:50:40,014 INFO L87 Difference]: Start difference. First operand 943 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:40,563 INFO L93 Difference]: Finished difference Result 2254 states and 2741 transitions. [2024-11-13 14:50:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:50:40,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:50:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:40,567 INFO L225 Difference]: With dead ends: 2254 [2024-11-13 14:50:40,568 INFO L226 Difference]: Without dead ends: 1314 [2024-11-13 14:50:40,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:50:40,569 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 30 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:40,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 502 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:50:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-13 14:50:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1303. [2024-11-13 14:50:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1198 states have (on average 1.182804674457429) internal successors, (1417), 1206 states have internal predecessors, (1417), 76 states have call successors, (76), 28 states have call predecessors, (76), 28 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 14:50:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1569 transitions. [2024-11-13 14:50:40,742 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1569 transitions. Word has length 115 [2024-11-13 14:50:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:40,742 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 1569 transitions. [2024-11-13 14:50:40,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1569 transitions. [2024-11-13 14:50:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:40,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:40,746 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:40,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (31)] Ended with exit code 0 [2024-11-13 14:50:40,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:40,946 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:40,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1940090093, now seen corresponding path program 1 times [2024-11-13 14:50:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:40,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006373673] [2024-11-13 14:50:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:40,948 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-13 14:50:40,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:40,954 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:40,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (32)] Waiting until timeout for monitored process [2024-11-13 14:50:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:41,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 14:50:41,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 10 proven. 74 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-13 14:50:41,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:42,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:42,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006373673] [2024-11-13 14:50:42,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006373673] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:42,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:42,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-13 14:50:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697075480] [2024-11-13 14:50:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:42,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:50:42,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:50:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:50:42,120 INFO L87 Difference]: Start difference. First operand 1303 states and 1569 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:42,591 INFO L93 Difference]: Finished difference Result 2855 states and 3416 transitions. [2024-11-13 14:50:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:50:42,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:50:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:42,599 INFO L225 Difference]: With dead ends: 2855 [2024-11-13 14:50:42,599 INFO L226 Difference]: Without dead ends: 1555 [2024-11-13 14:50:42,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:50:42,602 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 24 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:42,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 489 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:50:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-13 14:50:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1508. [2024-11-13 14:50:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1403 states have (on average 1.1689237348538846) internal successors, (1640), 1411 states have internal predecessors, (1640), 76 states have call successors, (76), 28 states have call predecessors, (76), 28 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 14:50:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1792 transitions. [2024-11-13 14:50:42,775 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1792 transitions. Word has length 115 [2024-11-13 14:50:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:42,776 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1792 transitions. [2024-11-13 14:50:42,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1792 transitions. [2024-11-13 14:50:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:42,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:42,778 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:42,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (32)] Ended with exit code 0 [2024-11-13 14:50:42,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:42,979 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:42,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash -555663939, now seen corresponding path program 1 times [2024-11-13 14:50:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844777346] [2024-11-13 14:50:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:42,980 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-13 14:50:42,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:42,982 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:42,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (33)] Waiting until timeout for monitored process [2024-11-13 14:50:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:43,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-13 14:50:43,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:44,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:50:44,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:50:45,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-11-13 14:50:45,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:45,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2024-11-13 14:50:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 14:50:45,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:45,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:45,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844777346] [2024-11-13 14:50:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844777346] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:45,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2024-11-13 14:50:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89091925] [2024-11-13 14:50:45,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:45,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:50:45,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:45,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:50:45,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:50:45,915 INFO L87 Difference]: Start difference. First operand 1508 states and 1792 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:46,985 INFO L93 Difference]: Finished difference Result 2521 states and 3013 transitions. [2024-11-13 14:50:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:50:46,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:50:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:46,990 INFO L225 Difference]: With dead ends: 2521 [2024-11-13 14:50:46,990 INFO L226 Difference]: Without dead ends: 1552 [2024-11-13 14:50:46,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-11-13 14:50:46,992 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 81 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:46,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1373 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:50:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-11-13 14:50:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1370. [2024-11-13 14:50:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1265 states have (on average 1.1620553359683794) internal successors, (1470), 1273 states have internal predecessors, (1470), 76 states have call successors, (76), 28 states have call predecessors, (76), 28 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 14:50:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1622 transitions. [2024-11-13 14:50:47,185 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1622 transitions. Word has length 115 [2024-11-13 14:50:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:47,186 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 1622 transitions. [2024-11-13 14:50:47,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1622 transitions. [2024-11-13 14:50:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:47,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:47,188 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:47,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (33)] Ended with exit code 0 [2024-11-13 14:50:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:47,389 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:47,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash -948690949, now seen corresponding path program 1 times [2024-11-13 14:50:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:47,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950731852] [2024-11-13 14:50:47,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:47,390 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-13 14:50:47,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:47,393 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:47,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (34)] Waiting until timeout for monitored process [2024-11-13 14:50:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:47,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 14:50:47,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:49,818 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-13 14:50:50,234 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 12 treesize of output 8 [2024-11-13 14:50:50,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2024-11-13 14:50:51,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:50:51,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 26 [2024-11-13 14:50:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 14:50:51,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:52,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950731852] [2024-11-13 14:50:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950731852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568341943] [2024-11-13 14:50:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:52,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:50:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:50:52,078 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:50:52,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-13 14:50:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:52,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:50:52,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:54,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:50:54,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:50:54,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-13 14:50:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-13 14:50:55,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:56,590 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-13 14:50:56,590 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 131 treesize of output 1 [2024-11-13 14:50:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-13 14:50:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568341943] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:56,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:50:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7, 8] total 24 [2024-11-13 14:50:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016360269] [2024-11-13 14:50:56,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:56,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 14:50:56,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:56,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 14:50:56,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2024-11-13 14:50:56,667 INFO L87 Difference]: Start difference. First operand 1370 states and 1622 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:58,873 INFO L93 Difference]: Finished difference Result 2916 states and 3472 transitions. [2024-11-13 14:50:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:50:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-13 14:50:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:58,879 INFO L225 Difference]: With dead ends: 2916 [2024-11-13 14:50:58,879 INFO L226 Difference]: Without dead ends: 2085 [2024-11-13 14:50:58,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 14:50:58,882 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 77 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:58,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1513 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:50:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2024-11-13 14:50:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1551. [2024-11-13 14:50:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1446 states have (on average 1.1708160442600277) internal successors, (1693), 1454 states have internal predecessors, (1693), 76 states have call successors, (76), 28 states have call predecessors, (76), 28 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 14:50:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1845 transitions. [2024-11-13 14:50:59,075 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1845 transitions. Word has length 115 [2024-11-13 14:50:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:59,075 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 1845 transitions. [2024-11-13 14:50:59,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:50:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1845 transitions. [2024-11-13 14:50:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 14:50:59,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:59,077 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 14:50:59,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (34)] Forceful destruction successful, exit code 0 [2024-11-13 14:50:59,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-13 14:50:59,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:50:59,479 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:59,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 830539455, now seen corresponding path program 1 times [2024-11-13 14:50:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:59,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878391606] [2024-11-13 14:50:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:59,481 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-13 14:50:59,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:59,484 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:50:59,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (36)] Waiting until timeout for monitored process [2024-11-13 14:51:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:00,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 14:51:00,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:01,926 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-13 14:51:02,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-13 14:51:02,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 14:51:03,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:03,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 22 [2024-11-13 14:51:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-13 14:51:03,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:04,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:04,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878391606] [2024-11-13 14:51:04,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878391606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:04,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662383387] [2024-11-13 14:51:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:04,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:51:04,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:51:04,686 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:51:04,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-13 14:51:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:04,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:51:04,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:08,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:51:08,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 14:51:08,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2024-11-13 14:51:13,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:13,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 57 treesize of output 27 [2024-11-13 14:51:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:51:13,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662383387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:13,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:51:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2024-11-13 14:51:13,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496035920] [2024-11-13 14:51:13,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:51:13,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:51:13,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:13,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:51:13,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=447, Unknown=1, NotChecked=0, Total=552 [2024-11-13 14:51:13,621 INFO L87 Difference]: Start difference. First operand 1551 states and 1845 transitions. Second operand has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 16 states have internal predecessors, (113), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 14:51:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:16,866 INFO L93 Difference]: Finished difference Result 2909 states and 3463 transitions. [2024-11-13 14:51:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:51:16,868 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 16 states have internal predecessors, (113), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 115 [2024-11-13 14:51:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:16,874 INFO L225 Difference]: With dead ends: 2909 [2024-11-13 14:51:16,874 INFO L226 Difference]: Without dead ends: 1897 [2024-11-13 14:51:16,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=346, Invalid=1213, Unknown=1, NotChecked=0, Total=1560 [2024-11-13 14:51:16,876 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 538 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:16,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 962 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 14:51:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2024-11-13 14:51:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1567. [2024-11-13 14:51:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1458 states have (on average 1.163923182441701) internal successors, (1697), 1466 states have internal predecessors, (1697), 76 states have call successors, (76), 32 states have call predecessors, (76), 32 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 14:51:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1849 transitions. [2024-11-13 14:51:17,062 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1849 transitions. Word has length 115 [2024-11-13 14:51:17,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:17,063 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 1849 transitions. [2024-11-13 14:51:17,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.647058823529412) internal successors, (113), 16 states have internal predecessors, (113), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-13 14:51:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1849 transitions. [2024-11-13 14:51:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-13 14:51:17,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:17,067 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:17,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-11-13 14:51:17,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (36)] Forceful destruction successful, exit code 0 [2024-11-13 14:51:17,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:51:17,467 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:17,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1705690090, now seen corresponding path program 1 times [2024-11-13 14:51:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:17,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865694900] [2024-11-13 14:51:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:17,469 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-13 14:51:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:17,470 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:51:17,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (38)] Waiting until timeout for monitored process [2024-11-13 14:51:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:17,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:51:17,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:19,517 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 17 treesize of output 13 [2024-11-13 14:51:19,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 14:51:20,008 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 17 treesize of output 9 [2024-11-13 14:51:20,873 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 19 treesize of output 11 [2024-11-13 14:51:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 11 proven. 785 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:51:21,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-11-13 14:51:21,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865694900] [2024-11-13 14:51:21,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865694900] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:21,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:51:21,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-13 14:51:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684917274] [2024-11-13 14:51:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:21,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:51:21,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:51:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:51:21,338 INFO L87 Difference]: Start difference. First operand 1567 states and 1849 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:21,999 INFO L93 Difference]: Finished difference Result 2241 states and 2656 transitions. [2024-11-13 14:51:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:51:22,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 217 [2024-11-13 14:51:22,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:22,006 INFO L225 Difference]: With dead ends: 2241 [2024-11-13 14:51:22,007 INFO L226 Difference]: Without dead ends: 1514 [2024-11-13 14:51:22,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:51:22,008 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 48 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:22,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 281 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:51:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-13 14:51:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1483. [2024-11-13 14:51:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1374 states have (on average 1.1506550218340612) internal successors, (1581), 1382 states have internal predecessors, (1581), 76 states have call successors, (76), 32 states have call predecessors, (76), 32 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-13 14:51:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1733 transitions. [2024-11-13 14:51:22,142 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1733 transitions. Word has length 217 [2024-11-13 14:51:22,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:22,142 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 1733 transitions. [2024-11-13 14:51:22,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1733 transitions. [2024-11-13 14:51:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-13 14:51:22,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:22,146 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:22,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (38)] Ended with exit code 0 [2024-11-13 14:51:22,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:51:22,347 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:22,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:22,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1286505490, now seen corresponding path program 1 times [2024-11-13 14:51:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735837967] [2024-11-13 14:51:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:22,348 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-13 14:51:22,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:22,349 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:51:22,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (39)] Waiting until timeout for monitored process [2024-11-13 14:51:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:22,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 14:51:22,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:51:24,399 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 17 treesize of output 13 [2024-11-13 14:51:24,774 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 23 treesize of output 15 [2024-11-13 14:51:24,856 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 17 treesize of output 9 [2024-11-13 14:51:36,858 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 44 treesize of output 36 [2024-11-13 14:51:36,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:51:36,911 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 64 treesize of output 48 [2024-11-13 14:51:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 9 proven. 789 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 14:51:41,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2024-11-13 14:51:50,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:51:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735837967] [2024-11-13 14:51:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735837967] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:51:50,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:51:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2024-11-13 14:51:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114144691] [2024-11-13 14:51:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:51:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:51:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:51:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:51:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:51:50,603 INFO L87 Difference]: Start difference. First operand 1483 states and 1733 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:58,660 INFO L93 Difference]: Finished difference Result 2267 states and 2657 transitions. [2024-11-13 14:51:58,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:51:58,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 219 [2024-11-13 14:51:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:58,673 INFO L225 Difference]: With dead ends: 2267 [2024-11-13 14:51:58,673 INFO L226 Difference]: Without dead ends: 1596 [2024-11-13 14:51:58,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:51:58,675 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 48 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:58,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 321 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-13 14:51:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-13 14:51:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 918. [2024-11-13 14:51:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 842 states have (on average 1.1437054631828978) internal successors, (963), 847 states have internal predecessors, (963), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 14:51:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1067 transitions. [2024-11-13 14:51:58,786 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1067 transitions. Word has length 219 [2024-11-13 14:51:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:58,786 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1067 transitions. [2024-11-13 14:51:58,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:51:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1067 transitions. [2024-11-13 14:51:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 14:51:58,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:58,789 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:58,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (39)] Ended with exit code 0 [2024-11-13 14:51:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:51:58,990 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 530703013, now seen corresponding path program 1 times [2024-11-13 14:51:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863575164] [2024-11-13 14:51:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:58,991 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-13 14:51:58,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:58,993 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:51:58,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (40)] Waiting until timeout for monitored process [2024-11-13 14:51:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:59,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:51:59,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:01,805 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 17 treesize of output 13 [2024-11-13 14:52:02,715 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-13 14:52:02,918 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 17 treesize of output 9 [2024-11-13 14:52:05,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 14:52:05,437 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 56 treesize of output 44 [2024-11-13 14:52:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 154 proven. 800 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 14:52:05,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:52:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-11-13 14:52:06,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:52:06,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863575164] [2024-11-13 14:52:06,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863575164] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:52:06,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:52:06,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2024-11-13 14:52:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536382702] [2024-11-13 14:52:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:06,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:52:06,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:52:06,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:52:06,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:52:06,960 INFO L87 Difference]: Start difference. First operand 918 states and 1067 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:52:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:08,532 INFO L93 Difference]: Finished difference Result 1437 states and 1677 transitions. [2024-11-13 14:52:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:52:08,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 220 [2024-11-13 14:52:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:08,537 INFO L225 Difference]: With dead ends: 1437 [2024-11-13 14:52:08,537 INFO L226 Difference]: Without dead ends: 950 [2024-11-13 14:52:08,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:52:08,538 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 24 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:08,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 563 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:52:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-13 14:52:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 910. [2024-11-13 14:52:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 834 states have (on average 1.1354916067146283) internal successors, (947), 839 states have internal predecessors, (947), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 14:52:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1051 transitions. [2024-11-13 14:52:08,627 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1051 transitions. Word has length 220 [2024-11-13 14:52:08,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:08,627 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1051 transitions. [2024-11-13 14:52:08,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:52:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1051 transitions. [2024-11-13 14:52:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 14:52:08,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:52:08,629 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:52:08,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (40)] Forceful destruction successful, exit code 0 [2024-11-13 14:52:08,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:52:08,830 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:52:08,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:52:08,830 INFO L85 PathProgramCache]: Analyzing trace with hash -366059085, now seen corresponding path program 1 times [2024-11-13 14:52:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:52:08,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304048012] [2024-11-13 14:52:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:52:08,831 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-13 14:52:08,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:52:08,833 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:52:08,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (41)] Waiting until timeout for monitored process [2024-11-13 14:52:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:52:09,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 14:52:09,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:52:11,954 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 17 treesize of output 13 [2024-11-13 14:52:12,870 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-13 14:52:13,044 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 17 treesize of output 9 [2024-11-13 14:52:15,657 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-13 14:52:15,658 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 55 treesize of output 40 [2024-11-13 14:52:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 154 proven. 800 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-13 14:52:15,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:52:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2024-11-13 14:52:17,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:52:17,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304048012] [2024-11-13 14:52:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304048012] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:52:17,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:52:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 23 [2024-11-13 14:52:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411545843] [2024-11-13 14:52:17,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:52:17,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:52:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:52:17,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:52:17,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:52:17,324 INFO L87 Difference]: Start difference. First operand 910 states and 1051 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:52:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:52:19,285 INFO L93 Difference]: Finished difference Result 1406 states and 1629 transitions. [2024-11-13 14:52:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:52:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 220 [2024-11-13 14:52:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:52:19,288 INFO L225 Difference]: With dead ends: 1406 [2024-11-13 14:52:19,288 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:52:19,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2024-11-13 14:52:19,290 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 34 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:52:19,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 530 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:52:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:52:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:52:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:52:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:52:19,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2024-11-13 14:52:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:52:19,292 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:52:19,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-13 14:52:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:52:19,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:52:19,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:52:19,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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 (41)] Ended with exit code 0 [2024-11-13 14:52:19,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:52:19,499 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 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-13 14:52:19,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 14:52:40,234 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification. DAG size of input: 199 DAG size of output: 211 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:52:51,448 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 199 DAG size of output: 211 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:53:02,496 WARN L286 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 199 DAG size of output: 220 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:53:14,272 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 199 DAG size of output: 211 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:53:22,412 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 199 DAG size of output: 220 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:53:37,492 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 199 DAG size of output: 220 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:53:48,661 WARN L286 SmtUtils]: Spent 9.70s on a formula simplification. DAG size of input: 199 DAG size of output: 211 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:53:58,322 WARN L286 SmtUtils]: Spent 9.66s on a formula simplification. DAG size of input: 218 DAG size of output: 230 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:54:06,868 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 199 DAG size of output: 220 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:54:19,035 WARN L286 SmtUtils]: Spent 9.92s on a formula simplification. DAG size of input: 218 DAG size of output: 230 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:59:11,796 WARN L286 SmtUtils]: Spent 4.86m on a formula simplification. DAG size of input: 356 DAG size of output: 411 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 14:59:40,285 WARN L286 SmtUtils]: Spent 19.07s on a formula simplification. DAG size of input: 887 DAG size of output: 74 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 15:00:03,964 WARN L286 SmtUtils]: Spent 23.62s on a formula simplification. DAG size of input: 1049 DAG size of output: 70 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 15:00:19,305 WARN L286 SmtUtils]: Spent 13.34s on a formula simplification. DAG size of input: 411 DAG size of output: 122 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 15:00:20,968 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:00:20,980 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset [2024-11-13 15:00:20,983 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset [2024-11-13 15:00:20,983 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset [2024-11-13 15:00:20,984 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,984 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:20,984 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:20,984 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:20,984 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:20,984 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,984 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,984 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,985 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:20,986 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:20,987 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:20,988 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:20,988 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base [2024-11-13 15:00:20,989 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:20,989 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:20,989 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset [2024-11-13 15:00:20,989 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:20,989 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:20,989 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:20,989 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:20,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset [2024-11-13 15:00:20,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:20,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:20,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2024-11-13 15:00:20,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset [2024-11-13 15:00:20,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:20,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:20,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base [2024-11-13 15:00:20,992 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:20,992 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:20,992 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:20,992 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:20,992 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:20,993 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-13 15:00:20,993 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-13 15:00:20,993 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:20,993 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:21,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset [2024-11-13 15:00:21,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:21,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:21,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:21,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:21,053 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:21,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:21,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:21,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:21,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:21,054 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base [2024-11-13 15:00:21,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:21,056 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:21,057 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,058 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base [2024-11-13 15:00:21,059 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset [2024-11-13 15:00:21,059 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset [2024-11-13 15:00:21,059 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base [2024-11-13 15:00:21,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-13 15:00:21,061 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:21,061 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,061 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset [2024-11-13 15:00:21,061 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset [2024-11-13 15:00:21,061 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#5 [2024-11-13 15:00:21,061 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] [2024-11-13 15:00:21,061 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] [2024-11-13 15:00:21,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:00:21 BoogieIcfgContainer [2024-11-13 15:00:21,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:00:21,071 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:00:21,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:00:21,072 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:00:21,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:48:45" (3/4) ... [2024-11-13 15:00:21,076 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 15:00:21,082 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-13 15:00:21,093 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-13 15:00:21,093 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 15:00:21,097 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 15:00:21,097 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 15:00:21,224 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 15:00:21,225 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 15:00:21,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:00:21,226 INFO L158 Benchmark]: Toolchain (without parser) took 698012.13ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 92.1MB in the beginning and 417.0MB in the end (delta: -324.9MB). Peak memory consumption was 462.1MB. Max. memory is 16.1GB. [2024-11-13 15:00:21,226 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:00:21,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.22ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 76.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:00:21,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.16ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 73.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:00:21,227 INFO L158 Benchmark]: Boogie Preprocessor took 115.51ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 69.2MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:00:21,227 INFO L158 Benchmark]: RCFGBuilder took 1435.85ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 77.1MB in the end (delta: -7.8MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-13 15:00:21,227 INFO L158 Benchmark]: TraceAbstraction took 695658.79ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 76.6MB in the beginning and 425.6MB in the end (delta: -349.1MB). Peak memory consumption was 533.9MB. Max. memory is 16.1GB. [2024-11-13 15:00:21,227 INFO L158 Benchmark]: Witness Printer took 153.96ms. Allocated memory is still 906.0MB. Free memory was 425.6MB in the beginning and 417.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:00:21,229 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.48ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.22ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 76.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.16ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 73.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 115.51ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 69.2MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1435.85ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 77.1MB in the end (delta: -7.8MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 695658.79ms. Allocated memory was 117.4MB in the beginning and 906.0MB in the end (delta: 788.5MB). Free memory was 76.6MB in the beginning and 425.6MB in the end (delta: -349.1MB). Peak memory consumption was 533.9MB. Max. memory is 16.1GB. * Witness Printer took 153.96ms. Allocated memory is still 906.0MB. Free memory was 425.6MB in the beginning and 417.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#unsigned_char_Array_0~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#signed_short_int_Array_0~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#5 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#5,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#5,GLOBAL],[IdentifierExpression[~unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer~0!base,GLOBAL]]] * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 214.0s, OverallIterations: 29, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 69.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 4236 SdHoareTripleChecker+Valid, 53.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4235 mSDsluCounter, 20297 SdHoareTripleChecker+Invalid, 50.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16306 mSDsCounter, 617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6862 IncrementalHoareTripleChecker+Invalid, 7481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 617 mSolverCounterUnsat, 3991 mSDtfsCounter, 6862 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7500 GetRequests, 6929 SyntacticMatches, 6 SemanticMatches, 565 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 3515 ImplicationChecksByTransitivity, 57.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1567occurred in iteration=25, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 3037 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.1s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 118.6s InterpolantComputationTime, 4832 NumberOfCodeBlocks, 4832 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 6782 ConstructedInterpolants, 657 QuantifiedInterpolants, 76239 SizeOfPredicates, 402 NumberOfNonLiveVariables, 11537 ConjunctsInSsa, 610 ConjunctsInUnsatCore, 54 InterpolantComputations, 22 PerfectInterpolantSequences, 14671/21428 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((((((((((((((((((isInitial == \old(isInitial)) && (BOOL_unsigned_char_Array_0 == \old(BOOL_unsigned_char_Array_0))) && (BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer == \old(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) && (float_Array_0 == \old(float_Array_0))) && (float_Array_0_arrayfloat_Array_0arrayVar0_Pointer == \old(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer))) && (float_Array_0_arrayfloat_Array_0arrayVar1_Pointer == \old(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) && (float_Array_0_arrayfloat_Array_0arrayVar2_Pointer == \old(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) && (signed_short_int_Array_0 == \old(signed_short_int_Array_0))) && (signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer == \old(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) && (signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer == \old(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer))) && (unsigned_char_Array_0 == \old(unsigned_char_Array_0))) && (unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer == \old(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) && (unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer == \old(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) && (unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer == \old(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))) && (unsigned_long_int_Array_0 == \old(unsigned_long_int_Array_0))) && (unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer == \old(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) && (last_1_unsigned_char_Array_0_2_ == \old(last_1_unsigned_char_Array_0_2_))) && (last_1_unsigned_long_int_Array_0_0_ == \old(last_1_unsigned_long_int_Array_0_0_)))) RESULT: Ultimate proved your program to be correct! [2024-11-13 15:00:21,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eae56205-d7a0-4858-9082-ab6bae880bac/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE