./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX --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 b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:32:17,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:32:17,135 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:32:17,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:32:17,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:32:17,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:32:17,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:32:17,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:32:17,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:32:17,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:32:17,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:32:17,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:32:17,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:32:17,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:32:17,181 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:32:17,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:32:17,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:32:17,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:32:17,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:32:17,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:32:17,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:32:17,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:32:17,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:32:17,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:32:17,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:32:17,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:32:17,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:32:17,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:32:17,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:32:17,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:32:17,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:32:17,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:32:17,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:32:17,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:32:17,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:32:17,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:32:17,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:32:17,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:32:17,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:32:17,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:32:17,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:32:17,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:32:17,203 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX 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 -> b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 [2024-11-08 16:32:17,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:32:17,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:32:17,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:32:17,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:32:17,610 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:32:17,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i Unable to find full path for "g++" [2024-11-08 16:32:19,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:32:19,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:32:19,875 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i [2024-11-08 16:32:19,889 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/data/7b988d09c/e9645fbce6184a28b1c047cbc60c1d28/FLAGbfdfee30b [2024-11-08 16:32:20,237 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/data/7b988d09c/e9645fbce6184a28b1c047cbc60c1d28 [2024-11-08 16:32:20,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:32:20,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:32:20,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:32:20,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:32:20,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:32:20,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef0801f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20, skipping insertion in model container [2024-11-08 16:32:20,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:32:20,555 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_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i[916,929] [2024-11-08 16:32:20,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:32:20,645 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:32:20,660 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_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i[916,929] [2024-11-08 16:32:20,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:32:20,749 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:32:20,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20 WrapperNode [2024-11-08 16:32:20,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:32:20,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:32:20,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:32:20,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:32:20,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,829 INFO L138 Inliner]: procedures = 30, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2024-11-08 16:32:20,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:32:20,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:32:20,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:32:20,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:32:20,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,868 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:32:20,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:32:20,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:32:20,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:32:20,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:32:20,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (1/1) ... [2024-11-08 16:32:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:32:20,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:32:20,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:32:20,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:32:21,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:32:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:32:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:32:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:32:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:32:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:32:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:32:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:32:21,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:32:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:32:21,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:32:21,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:32:21,233 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:32:21,235 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:32:21,982 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-08 16:32:21,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:32:21,999 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:32:22,000 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:32:22,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:32:22 BoogieIcfgContainer [2024-11-08 16:32:22,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:32:22,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:32:22,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:32:22,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:32:22,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:32:20" (1/3) ... [2024-11-08 16:32:22,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26763e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:32:22, skipping insertion in model container [2024-11-08 16:32:22,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:20" (2/3) ... [2024-11-08 16:32:22,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26763e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:32:22, skipping insertion in model container [2024-11-08 16:32:22,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:32:22" (3/3) ... [2024-11-08 16:32:22,012 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-54.i [2024-11-08 16:32:22,034 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:32:22,035 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:32:22,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:32:22,125 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;@76a404d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:32:22,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:32:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 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-08 16:32:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 16:32:22,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:22,156 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-08 16:32:22,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:22,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 52424814, now seen corresponding path program 1 times [2024-11-08 16:32:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:22,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737225576] [2024-11-08 16:32:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,269 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-08 16:32:23,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:23,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737225576] [2024-11-08 16:32:23,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737225576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:23,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:23,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:32:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732656392] [2024-11-08 16:32:23,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:23,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:32:23,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:32:23,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:23,332 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 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 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-08 16:32:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:23,418 INFO L93 Difference]: Finished difference Result 215 states and 333 transitions. [2024-11-08 16:32:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:32:23,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-08 16:32:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:23,437 INFO L225 Difference]: With dead ends: 215 [2024-11-08 16:32:23,437 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 16:32:23,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:23,451 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:23,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:32:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 16:32:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 16:32:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 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-08 16:32:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-08 16:32:23,532 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-08 16:32:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:23,538 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-08 16:32:23,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-08 16:32:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-08 16:32:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 16:32:23,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:23,545 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-08 16:32:23,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:32:23,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:23,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:23,547 INFO L85 PathProgramCache]: Analyzing trace with hash -173581751, now seen corresponding path program 1 times [2024-11-08 16:32:23,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:23,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255981197] [2024-11-08 16:32:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:23,867 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-08 16:32:23,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255981197] [2024-11-08 16:32:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255981197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:23,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:32:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327630452] [2024-11-08 16:32:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:23,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:32:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:23,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:32:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:23,873 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:32:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:23,920 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-08 16:32:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:32:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:32:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:23,923 INFO L225 Difference]: With dead ends: 216 [2024-11-08 16:32:23,923 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:32:23,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:23,926 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:23,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:32:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:32:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 16:32:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 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-08 16:32:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-08 16:32:23,941 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 107 [2024-11-08 16:32:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:23,943 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-08 16:32:23,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:32:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-08 16:32:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 16:32:23,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:23,946 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-08 16:32:23,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:32:23,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:23,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1601425611, now seen corresponding path program 1 times [2024-11-08 16:32:23,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:23,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701794841] [2024-11-08 16:32:23,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:23,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:24,302 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-08 16:32:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701794841] [2024-11-08 16:32:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701794841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:24,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:24,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:32:24,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94668492] [2024-11-08 16:32:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:24,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:32:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:32:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:24,308 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:32:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:24,361 INFO L93 Difference]: Finished difference Result 220 states and 319 transitions. [2024-11-08 16:32:24,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:32:24,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:32:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:24,369 INFO L225 Difference]: With dead ends: 220 [2024-11-08 16:32:24,369 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 16:32:24,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:24,374 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:24,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:32:24,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 16:32:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-08 16:32:24,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 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-08 16:32:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-08 16:32:24,396 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2024-11-08 16:32:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:24,397 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-08 16:32:24,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:32:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-08 16:32:24,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 16:32:24,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:24,400 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-08 16:32:24,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:32:24,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1603272653, now seen corresponding path program 1 times [2024-11-08 16:32:24,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:24,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592080911] [2024-11-08 16:32:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:25,231 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-08 16:32:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592080911] [2024-11-08 16:32:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592080911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:25,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:32:25,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356357071] [2024-11-08 16:32:25,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:25,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:32:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:25,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:32:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:32:25,239 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-08 16:32:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:25,868 INFO L93 Difference]: Finished difference Result 323 states and 466 transitions. [2024-11-08 16:32:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:32:25,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-08 16:32:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:25,873 INFO L225 Difference]: With dead ends: 323 [2024-11-08 16:32:25,873 INFO L226 Difference]: Without dead ends: 214 [2024-11-08 16:32:25,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:32:25,876 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 125 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:25,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 302 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:32:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-08 16:32:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 133. [2024-11-08 16:32:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 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-08 16:32:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-11-08 16:32:25,891 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 107 [2024-11-08 16:32:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:25,892 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-11-08 16:32:25,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-08 16:32:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-11-08 16:32:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 16:32:25,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:25,896 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-08 16:32:25,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:32:25,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:25,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash 39786709, now seen corresponding path program 1 times [2024-11-08 16:32:25,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063384098] [2024-11-08 16:32:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:27,714 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-08 16:32:27,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:27,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063384098] [2024-11-08 16:32:27,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063384098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:27,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:27,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:32:27,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309819697] [2024-11-08 16:32:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:27,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:32:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:32:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:27,724 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-08 16:32:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:28,088 INFO L93 Difference]: Finished difference Result 368 states and 536 transitions. [2024-11-08 16:32:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:32:28,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-08 16:32:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:28,091 INFO L225 Difference]: With dead ends: 368 [2024-11-08 16:32:28,091 INFO L226 Difference]: Without dead ends: 238 [2024-11-08 16:32:28,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-08 16:32:28,093 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 103 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:28,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 249 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:32:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-08 16:32:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-08 16:32:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 16:32:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2024-11-08 16:32:28,114 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 108 [2024-11-08 16:32:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:28,115 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2024-11-08 16:32:28,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-08 16:32:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2024-11-08 16:32:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 16:32:28,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:28,118 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-08 16:32:28,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:32:28,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:28,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:28,119 INFO L85 PathProgramCache]: Analyzing trace with hash -777861741, now seen corresponding path program 1 times [2024-11-08 16:32:28,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:28,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968379872] [2024-11-08 16:32:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:29,632 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-08 16:32:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968379872] [2024-11-08 16:32:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968379872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:29,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:29,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:32:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847252109] [2024-11-08 16:32:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:29,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:32:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:29,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:32:29,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:32:29,643 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 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-08 16:32:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:30,319 INFO L93 Difference]: Finished difference Result 595 states and 853 transitions. [2024-11-08 16:32:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:32:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 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 108 [2024-11-08 16:32:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:30,322 INFO L225 Difference]: With dead ends: 595 [2024-11-08 16:32:30,322 INFO L226 Difference]: Without dead ends: 364 [2024-11-08 16:32:30,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:32:30,325 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 77 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:30,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 608 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:32:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-08 16:32:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2024-11-08 16:32:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.3761755485893417) internal successors, (439), 321 states have internal predecessors, (439), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:32:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 511 transitions. [2024-11-08 16:32:30,375 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 511 transitions. Word has length 108 [2024-11-08 16:32:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:30,376 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 511 transitions. [2024-11-08 16:32:30,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 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-08 16:32:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 511 transitions. [2024-11-08 16:32:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:32:30,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:30,381 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-08 16:32:30,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:32:30,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash -641474360, now seen corresponding path program 1 times [2024-11-08 16:32:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:30,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967796644] [2024-11-08 16:32:30,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:31,669 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-08 16:32:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:31,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967796644] [2024-11-08 16:32:31,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967796644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:31,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:31,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:32:31,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922984116] [2024-11-08 16:32:31,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:31,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:32:31,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:31,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:32:31,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:32:31,675 INFO L87 Difference]: Start difference. First operand 360 states and 511 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-08 16:32:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:33,066 INFO L93 Difference]: Finished difference Result 760 states and 1083 transitions. [2024-11-08 16:32:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:32:33,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-08 16:32:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:33,072 INFO L225 Difference]: With dead ends: 760 [2024-11-08 16:32:33,072 INFO L226 Difference]: Without dead ends: 564 [2024-11-08 16:32:33,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:32:33,074 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 134 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:33,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1383 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 16:32:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-11-08 16:32:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 388. [2024-11-08 16:32:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3919308357348703) internal successors, (483), 349 states have internal predecessors, (483), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:32:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 555 transitions. [2024-11-08 16:32:33,112 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 555 transitions. Word has length 109 [2024-11-08 16:32:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:33,113 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 555 transitions. [2024-11-08 16:32:33,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-08 16:32:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 555 transitions. [2024-11-08 16:32:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:32:33,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:33,115 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-08 16:32:33,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:32:33,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:33,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1652591610, now seen corresponding path program 1 times [2024-11-08 16:32:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:33,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146809188] [2024-11-08 16:32:33,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:34,342 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-08 16:32:34,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:34,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146809188] [2024-11-08 16:32:34,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146809188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:34,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:34,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:32:34,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754274399] [2024-11-08 16:32:34,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:34,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:32:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:32:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:32:34,346 INFO L87 Difference]: Start difference. First operand 388 states and 555 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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-08 16:32:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:35,027 INFO L93 Difference]: Finished difference Result 697 states and 996 transitions. [2024-11-08 16:32:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:32:35,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 109 [2024-11-08 16:32:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:35,034 INFO L225 Difference]: With dead ends: 697 [2024-11-08 16:32:35,034 INFO L226 Difference]: Without dead ends: 473 [2024-11-08 16:32:35,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:32:35,036 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 76 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:35,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 637 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:32:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-08 16:32:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 388. [2024-11-08 16:32:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3861671469740633) internal successors, (481), 349 states have internal predecessors, (481), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:32:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 553 transitions. [2024-11-08 16:32:35,083 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 553 transitions. Word has length 109 [2024-11-08 16:32:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:35,084 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 553 transitions. [2024-11-08 16:32:35,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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-08 16:32:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 553 transitions. [2024-11-08 16:32:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:32:35,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:35,087 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-08 16:32:35,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:32:35,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:35,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash -775487866, now seen corresponding path program 1 times [2024-11-08 16:32:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699254484] [2024-11-08 16:32:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:36,283 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-08 16:32:36,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699254484] [2024-11-08 16:32:36,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699254484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:36,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:36,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:32:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466072638] [2024-11-08 16:32:36,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:36,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:32:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:36,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:32:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:32:36,286 INFO L87 Difference]: Start difference. First operand 388 states and 553 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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-08 16:32:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:36,905 INFO L93 Difference]: Finished difference Result 699 states and 994 transitions. [2024-11-08 16:32:36,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:32:36,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 109 [2024-11-08 16:32:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:36,909 INFO L225 Difference]: With dead ends: 699 [2024-11-08 16:32:36,910 INFO L226 Difference]: Without dead ends: 475 [2024-11-08 16:32:36,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:32:36,912 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 79 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:36,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 630 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:32:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-08 16:32:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 388. [2024-11-08 16:32:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 347 states have (on average 1.3804034582132565) internal successors, (479), 349 states have internal predecessors, (479), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:32:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 551 transitions. [2024-11-08 16:32:36,945 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 551 transitions. Word has length 109 [2024-11-08 16:32:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:36,946 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 551 transitions. [2024-11-08 16:32:36,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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-08 16:32:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 551 transitions. [2024-11-08 16:32:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:32:36,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:36,948 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-08 16:32:36,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:32:36,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:36,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:36,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1786605116, now seen corresponding path program 1 times [2024-11-08 16:32:36,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:36,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733335769] [2024-11-08 16:32:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:36,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:37,461 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-08 16:32:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:37,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733335769] [2024-11-08 16:32:37,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733335769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:37,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:32:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078368095] [2024-11-08 16:32:37,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:32:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:37,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:32:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:32:37,464 INFO L87 Difference]: Start difference. First operand 388 states and 551 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-08 16:32:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:38,026 INFO L93 Difference]: Finished difference Result 782 states and 1109 transitions. [2024-11-08 16:32:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:32:38,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-08 16:32:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:38,030 INFO L225 Difference]: With dead ends: 782 [2024-11-08 16:32:38,030 INFO L226 Difference]: Without dead ends: 558 [2024-11-08 16:32:38,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:32:38,034 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 129 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:38,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1188 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:32:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-08 16:32:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 382. [2024-11-08 16:32:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 341 states have (on average 1.3812316715542523) internal successors, (471), 343 states have internal predecessors, (471), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:32:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 543 transitions. [2024-11-08 16:32:38,067 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 543 transitions. Word has length 109 [2024-11-08 16:32:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:38,067 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 543 transitions. [2024-11-08 16:32:38,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 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-08 16:32:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 543 transitions. [2024-11-08 16:32:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 16:32:38,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:38,070 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-08 16:32:38,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:32:38,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1391498747, now seen corresponding path program 1 times [2024-11-08 16:32:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:38,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847201038] [2024-11-08 16:32:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:32:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:32:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:32:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:32:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:32:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:32:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:32:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:32:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:32:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:32:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:32:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:32:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:38,544 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-08 16:32:38,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:32:38,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847201038] [2024-11-08 16:32:38,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847201038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:38,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:38,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:32:38,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549134252] [2024-11-08 16:32:38,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:38,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:32:38,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:32:38,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:32:38,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:32:38,547 INFO L87 Difference]: Start difference. First operand 382 states and 543 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) 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-08 16:32:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:38,956 INFO L93 Difference]: Finished difference Result 440 states and 617 transitions. [2024-11-08 16:32:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:32:38,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-08 16:32:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:38,960 INFO L225 Difference]: With dead ends: 440 [2024-11-08 16:32:38,960 INFO L226 Difference]: Without dead ends: 438 [2024-11-08 16:32:38,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:32:38,962 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 113 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:38,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 565 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:32:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-08 16:32:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 437. [2024-11-08 16:32:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 383 states have (on average 1.3550913838120104) internal successors, (519), 386 states have internal predecessors, (519), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:32:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 611 transitions. [2024-11-08 16:32:39,000 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 611 transitions. Word has length 110 [2024-11-08 16:32:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:39,001 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 611 transitions. [2024-11-08 16:32:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-08 16:32:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 611 transitions. [2024-11-08 16:32:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 16:32:39,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:39,003 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-08 16:32:39,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:32:39,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:39,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:39,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1389651705, now seen corresponding path program 1 times [2024-11-08 16:32:39,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:32:39,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651091250] [2024-11-08 16:32:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:39,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:32:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:32:39,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:32:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:32:39,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:32:39,300 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:32:39,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:32:39,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:32:39,307 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:32:39,378 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:32:39,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:32:39 BoogieIcfgContainer [2024-11-08 16:32:39,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:32:39,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:32:39,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:32:39,384 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:32:39,385 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:32:22" (3/4) ... [2024-11-08 16:32:39,387 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:32:39,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:32:39,389 INFO L158 Benchmark]: Toolchain (without parser) took 19147.64ms. Allocated memory was 136.3MB in the beginning and 400.6MB in the end (delta: 264.2MB). Free memory was 71.1MB in the beginning and 177.0MB in the end (delta: -105.9MB). Peak memory consumption was 160.6MB. Max. memory is 16.1GB. [2024-11-08 16:32:39,390 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 136.3MB. Free memory was 108.3MB in the beginning and 108.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:32:39,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.93ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 71.0MB in the beginning and 150.7MB in the end (delta: -79.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-08 16:32:39,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.51ms. Allocated memory is still 190.8MB. Free memory was 150.7MB in the beginning and 146.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:32:39,391 INFO L158 Benchmark]: Boogie Preprocessor took 99.46ms. Allocated memory is still 190.8MB. Free memory was 146.9MB in the beginning and 142.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:32:39,391 INFO L158 Benchmark]: RCFGBuilder took 1069.54ms. Allocated memory is still 190.8MB. Free memory was 142.5MB in the beginning and 130.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 16:32:39,392 INFO L158 Benchmark]: TraceAbstraction took 17379.44ms. Allocated memory was 190.8MB in the beginning and 400.6MB in the end (delta: 209.7MB). Free memory was 130.8MB in the beginning and 178.1MB in the end (delta: -47.3MB). Peak memory consumption was 164.4MB. Max. memory is 16.1GB. [2024-11-08 16:32:39,392 INFO L158 Benchmark]: Witness Printer took 5.35ms. Allocated memory is still 400.6MB. Free memory was 178.1MB in the beginning and 177.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:32:39,394 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.23ms. Allocated memory is still 136.3MB. Free memory was 108.3MB in the beginning and 108.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.93ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 71.0MB in the beginning and 150.7MB in the end (delta: -79.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.51ms. Allocated memory is still 190.8MB. Free memory was 150.7MB in the beginning and 146.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.46ms. Allocated memory is still 190.8MB. Free memory was 146.9MB in the beginning and 142.5MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1069.54ms. Allocated memory is still 190.8MB. Free memory was 142.5MB in the beginning and 130.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17379.44ms. Allocated memory was 190.8MB in the beginning and 400.6MB in the end (delta: 209.7MB). Free memory was 130.8MB in the beginning and 178.1MB in the end (delta: -47.3MB). Peak memory consumption was 164.4MB. Max. memory is 16.1GB. * Witness Printer took 5.35ms. Allocated memory is still 400.6MB. Free memory was 178.1MB in the beginning and 177.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 109. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_12 [L99] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_12 [L99] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_13 [L101] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L54] EXPR WrapperStruct00.var_1_12 [L54] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_12 [L55] EXPR WrapperStruct00.var_1_16 [L55] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L56] signed long int stepLocal_0 = -4; [L57] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=-4] [L57] COND FALSE !(stepLocal_0 >= WrapperStruct00.var_1_15) [L60] EXPR WrapperStruct00.var_1_3 [L60] unsigned char stepLocal_2 = WrapperStruct00.var_1_3; [L61] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L61] COND FALSE !(WrapperStruct00.var_1_9) [L70] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L70] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) [L70] EXPR WrapperStruct00.var_1_1 [L70] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_2=7] [L70] signed long int stepLocal_1 = (((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)); [L71] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16, stepLocal_2=7] [L71] COND FALSE !((8 * WrapperStruct00.var_1_1) == stepLocal_1) [L82] EXPR WrapperStruct00.var_1_10 [L82] WrapperStruct00.var_1_4 = WrapperStruct00.var_1_10 [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10))) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) [L109] EXPR WrapperStruct00.var_1_1 [L109] EXPR ((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)) [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_10 [L109] EXPR ((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1) [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR ((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12)) [L109] EXPR WrapperStruct00.var_1_14 [L109] EXPR WrapperStruct00.var_1_12 [L109] EXPR ((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1] [L109-L110] return (((((-4 >= WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_1 == ((unsigned char) ((((WrapperStruct00.var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (WrapperStruct00.var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * WrapperStruct00.var_1_1) == ((((10) > (WrapperStruct00.var_1_1)) ? (10) : (WrapperStruct00.var_1_1)))) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_4 == ((unsigned char) ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_14) && WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_14 >= ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) ? (WrapperStruct00.var_1_4 == ((unsigned char) (! WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_4 == ((unsigned char) 0)))) : (WrapperStruct00.var_1_4 == ((unsigned char) WrapperStruct00.var_1_10)))) && (WrapperStruct00.var_1_9 ? ((WrapperStruct00.var_1_3 > WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_11 == ((double) ((((((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) > (WrapperStruct00.var_1_13)) ? (((((WrapperStruct00.var_1_12) > (16.5)) ? (WrapperStruct00.var_1_12) : (16.5)))) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_10 ? (WrapperStruct00.var_1_11 == ((double) WrapperStruct00.var_1_12)) : 1)) : 1)) && (WrapperStruct00.var_1_14 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 841 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 838 mSDsluCounter, 6903 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5228 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3468 IncrementalHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 1675 mSDtfsCounter, 3468 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 616 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1298 NumberOfCodeBlocks, 1298 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 2686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2904/2904 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-08 16:32:39,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX --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 b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:32:42,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:32:42,296 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:32:42,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:32:42,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:32:42,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:32:42,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:32:42,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:32:42,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:32:42,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:32:42,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:32:42,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:32:42,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:32:42,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:32:42,378 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:32:42,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:32:42,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:32:42,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:32:42,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:32:42,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:32:42,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:32:42,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:32:42,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:32:42,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:32:42,381 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:32:42,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:32:42,381 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:32:42,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:32:42,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:32:42,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:32:42,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:32:42,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:32:42,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:32:42,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:32:42,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:32:42,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:32:42,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:32:42,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:32:42,387 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:32:42,388 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:32:42,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:32:42,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:32:42,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:32:42,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:32:42,389 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX 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 -> b6271bd0a37fb423024bed9c2fae52ec13738291896513228b822cdc7afdfa85 [2024-11-08 16:32:42,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:32:42,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:32:42,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:32:42,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:32:42,909 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:32:42,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i Unable to find full path for "g++" [2024-11-08 16:32:45,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:32:45,337 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:32:45,338 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i [2024-11-08 16:32:45,348 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/data/39e5e4788/1c258f9ffa3f47f3be63765d62ccf56d/FLAG19b7a109a [2024-11-08 16:32:45,365 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/data/39e5e4788/1c258f9ffa3f47f3be63765d62ccf56d [2024-11-08 16:32:45,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:32:45,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:32:45,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:32:45,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:32:45,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:32:45,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:45,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d8c86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45, skipping insertion in model container [2024-11-08 16:32:45,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:45,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:32:45,692 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_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i[916,929] [2024-11-08 16:32:45,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:32:45,830 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:32:45,850 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_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-54.i[916,929] [2024-11-08 16:32:45,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:32:45,977 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:32:45,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45 WrapperNode [2024-11-08 16:32:45,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:32:45,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:32:45,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:32:45,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:32:45,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,095 INFO L138 Inliner]: procedures = 34, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 461 [2024-11-08 16:32:46,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:32:46,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:32:46,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:32:46,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:32:46,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,184 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-08 16:32:46,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:32:46,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:32:46,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:32:46,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:32:46,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (1/1) ... [2024-11-08 16:32:46,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:32:46,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:32:46,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:32:46,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:32:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:32:46,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:32:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:32:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-08 16:32:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-08 16:32:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:32:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:32:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:32:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:32:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:32:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:32:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 16:32:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 16:32:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 16:32:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 16:32:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:32:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:32:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:32:46,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:32:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 16:32:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 16:32:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:32:46,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:32:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:32:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:32:46,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:32:46,522 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:32:48,726 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-08 16:32:48,726 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:32:48,745 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:32:48,745 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:32:48,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:32:48 BoogieIcfgContainer [2024-11-08 16:32:48,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:32:48,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:32:48,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:32:48,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:32:48,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:32:45" (1/3) ... [2024-11-08 16:32:48,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5140af00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:32:48, skipping insertion in model container [2024-11-08 16:32:48,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:32:45" (2/3) ... [2024-11-08 16:32:48,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5140af00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:32:48, skipping insertion in model container [2024-11-08 16:32:48,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:32:48" (3/3) ... [2024-11-08 16:32:48,756 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-54.i [2024-11-08 16:32:48,771 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:32:48,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:32:48,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:32:48,847 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;@350deaea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:32:48,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:32:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 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-08 16:32:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 16:32:48,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:48,871 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-08 16:32:48,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:48,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1225739204, now seen corresponding path program 1 times [2024-11-08 16:32:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:32:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471733211] [2024-11-08 16:32:48,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:48,906 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-08 16:32:48,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:32:48,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:48,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:49,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:32:49,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:32:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-08 16:32:49,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:32:49,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:32:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471733211] [2024-11-08 16:32:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471733211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:49,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:49,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:32:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043292354] [2024-11-08 16:32:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:49,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:32:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:32:49,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:32:49,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:32:49,525 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-08 16:32:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:49,575 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-08 16:32:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:32:49,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 105 [2024-11-08 16:32:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:49,591 INFO L225 Difference]: With dead ends: 213 [2024-11-08 16:32:49,592 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 16:32:49,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-08 16:32:49,603 INFO L432 NwaCegarLoop]: 155 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, 155 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-08 16:32:49,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:32:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 16:32:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 16:32:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 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-08 16:32:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-08 16:32:49,669 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2024-11-08 16:32:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:49,670 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-08 16:32:49,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-08 16:32:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-08 16:32:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 16:32:49,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:49,675 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-08 16:32:49,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:32:49,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:49,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:49,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2000187248, now seen corresponding path program 1 times [2024-11-08 16:32:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:32:49,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928416774] [2024-11-08 16:32:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:49,879 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-08 16:32:49,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:32:49,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:49,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:50,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:32:50,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:32:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-08 16:32:50,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:32:50,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:32:50,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928416774] [2024-11-08 16:32:50,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928416774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:50,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:50,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:32:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577475002] [2024-11-08 16:32:50,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:50,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:32:50,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:32:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:32:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:50,363 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 16:32:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:50,524 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-08 16:32:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:32:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 105 [2024-11-08 16:32:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:50,538 INFO L225 Difference]: With dead ends: 211 [2024-11-08 16:32:50,539 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 16:32:50,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:50,543 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:50,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:32:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 16:32:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 16:32:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 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-08 16:32:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-08 16:32:50,570 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2024-11-08 16:32:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:50,574 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-08 16:32:50,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 16:32:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-08 16:32:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 16:32:50,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:50,581 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-08 16:32:50,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:50,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:50,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:50,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:50,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1397386770, now seen corresponding path program 1 times [2024-11-08 16:32:50,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:32:50,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563492927] [2024-11-08 16:32:50,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:50,784 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-08 16:32:50,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:32:50,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:50,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:32:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:51,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:32:51,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:32:51,248 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-08 16:32:51,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:32:51,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:32:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563492927] [2024-11-08 16:32:51,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563492927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:51,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:51,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:32:51,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74916033] [2024-11-08 16:32:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:51,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:32:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:32:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:32:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:51,253 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-08 16:32:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:51,323 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-08 16:32:51,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:32:51,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-08 16:32:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:51,329 INFO L225 Difference]: With dead ends: 215 [2024-11-08 16:32:51,329 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 16:32:51,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:32:51,331 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:51,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:32:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 16:32:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 16:32:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 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-08 16:32:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-08 16:32:51,356 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 105 [2024-11-08 16:32:51,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:51,357 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-08 16:32:51,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-08 16:32:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-08 16:32:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 16:32:51,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:51,363 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-08 16:32:51,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 16:32:51,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:51,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:51,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1873109815, now seen corresponding path program 1 times [2024-11-08 16:32:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:32:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504285256] [2024-11-08 16:32:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:51,570 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-08 16:32:51,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:32:51,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:51,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:51,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:32:51,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:32:52,037 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-08 16:32:52,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:32:52,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:32:52,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504285256] [2024-11-08 16:32:52,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504285256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:52,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:52,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:32:52,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061538551] [2024-11-08 16:32:52,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:52,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:32:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:32:52,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:32:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:32:52,044 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-08 16:32:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:52,293 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-11-08 16:32:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:32:52,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-08 16:32:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:52,296 INFO L225 Difference]: With dead ends: 222 [2024-11-08 16:32:52,296 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 16:32:52,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-08 16:32:52,299 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:52,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:32:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 16:32:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-08 16:32:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 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-08 16:32:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-08 16:32:52,311 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 107 [2024-11-08 16:32:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:52,312 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-08 16:32:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-08 16:32:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-08 16:32:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 16:32:52,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:52,315 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-08 16:32:52,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:32:52,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:52,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:52,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash -98102453, now seen corresponding path program 1 times [2024-11-08 16:32:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:32:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43941510] [2024-11-08 16:32:52,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:52,522 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-08 16:32:52,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:32:52,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:52,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:32:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:52,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:32:52,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:32:52,986 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-08 16:32:52,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:32:52,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:32:52,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43941510] [2024-11-08 16:32:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43941510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:32:52,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:32:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:32:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111853560] [2024-11-08 16:32:52,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:32:52,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:32:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:32:52,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:32:52,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:32:52,992 INFO L87 Difference]: Start difference. First operand 114 states and 163 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-08 16:32:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:32:53,224 INFO L93 Difference]: Finished difference Result 228 states and 327 transitions. [2024-11-08 16:32:53,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:32:53,225 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-08 16:32:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:32:53,226 INFO L225 Difference]: With dead ends: 228 [2024-11-08 16:32:53,226 INFO L226 Difference]: Without dead ends: 117 [2024-11-08 16:32:53,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:32:53,228 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:32:53,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:32:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-08 16:32:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-08 16:32:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 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-08 16:32:53,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2024-11-08 16:32:53,240 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 107 [2024-11-08 16:32:53,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:32:53,240 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2024-11-08 16:32:53,241 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-08 16:32:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2024-11-08 16:32:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 16:32:53,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:32:53,243 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-08 16:32:53,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 16:32:53,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:53,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:32:53,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:32:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash -96255411, now seen corresponding path program 1 times [2024-11-08 16:32:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:32:53,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629236160] [2024-11-08 16:32:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:32:53,450 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-08 16:32:53,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:32:53,453 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:53,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:32:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:32:53,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:32:53,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:32:54,057 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 86 treesize of output 85 [2024-11-08 16:32:54,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 136 [2024-11-08 16:32:55,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 136 [2024-11-08 16:32:57,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 134 [2024-11-08 16:32:58,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 131 [2024-11-08 16:32:59,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 139 [2024-11-08 16:33:13,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 147 [2024-11-08 16:33:31,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 137 [2024-11-08 16:33:48,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 150 [2024-11-08 16:34:07,344 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 153 treesize of output 129 [2024-11-08 16:34:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 56 proven. 80 refuted. 108 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 16:34:07,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:34:08,206 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-08 16:34:08,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:34:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629236160] [2024-11-08 16:34:08,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629236160] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:34:08,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:34:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-08 16:34:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612453759] [2024-11-08 16:34:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:08,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:34:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:34:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:34:08,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=84, Unknown=11, NotChecked=0, Total=132 [2024-11-08 16:34:08,213 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:34:12,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:34:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:15,522 INFO L93 Difference]: Finished difference Result 342 states and 489 transitions. [2024-11-08 16:34:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:34:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:34:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:15,525 INFO L225 Difference]: With dead ends: 342 [2024-11-08 16:34:15,526 INFO L226 Difference]: Without dead ends: 229 [2024-11-08 16:34:15,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 68.9s TimeCoverageRelationStatistics Valid=41, Invalid=104, Unknown=11, NotChecked=0, Total=156 [2024-11-08 16:34:15,530 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 108 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:15,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 245 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2024-11-08 16:34:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-08 16:34:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2024-11-08 16:34:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 198 states have (on average 1.3838383838383839) internal successors, (274), 198 states have internal predecessors, (274), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 16:34:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 322 transitions. [2024-11-08 16:34:15,566 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 322 transitions. Word has length 107 [2024-11-08 16:34:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:15,570 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 322 transitions. [2024-11-08 16:34:15,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-08 16:34:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 322 transitions. [2024-11-08 16:34:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 16:34:15,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:15,573 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-08 16:34:15,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:34:15,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:34:15,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:15,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:15,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1785199153, now seen corresponding path program 1 times [2024-11-08 16:34:15,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:34:15,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350348876] [2024-11-08 16:34:15,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:15,775 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-08 16:34:15,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:34:15,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:34:15,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:34:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:16,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:34:16,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:34:16,229 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 21 [2024-11-08 16:34:16,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:34:16,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2024-11-08 16:34:16,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:34:16,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 21 [2024-11-08 16:34:16,818 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-08 16:34:16,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:34:16,819 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:34:16,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350348876] [2024-11-08 16:34:16,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350348876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:34:16,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:34:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:34:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547768185] [2024-11-08 16:34:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:34:16,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:34:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:34:16,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:34:16,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:34:16,822 INFO L87 Difference]: Start difference. First operand 225 states and 322 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-08 16:34:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:34:24,258 INFO L93 Difference]: Finished difference Result 696 states and 989 transitions. [2024-11-08 16:34:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:34:24,260 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-08 16:34:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:34:24,263 INFO L225 Difference]: With dead ends: 696 [2024-11-08 16:34:24,264 INFO L226 Difference]: Without dead ends: 474 [2024-11-08 16:34:24,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:34:24,265 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 249 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:34:24,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 500 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-08 16:34:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-08 16:34:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 466. [2024-11-08 16:34:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 403 states have (on average 1.3598014888337469) internal successors, (548), 407 states have internal predecessors, (548), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:34:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 660 transitions. [2024-11-08 16:34:24,321 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 660 transitions. Word has length 107 [2024-11-08 16:34:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:34:24,322 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 660 transitions. [2024-11-08 16:34:24,322 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-08 16:34:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 660 transitions. [2024-11-08 16:34:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 16:34:24,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:34:24,324 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-08 16:34:24,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-08 16:34:24,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:34:24,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:34:24,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:34:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1336818151, now seen corresponding path program 1 times [2024-11-08 16:34:24,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:34:24,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425328205] [2024-11-08 16:34:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:34:24,526 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-08 16:34:24,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:34:24,527 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:34:24,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:34:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:34:24,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 16:34:24,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:34:24,956 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 87 treesize of output 86 [2024-11-08 16:34:25,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 128 [2024-11-08 16:34:25,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 125 [2024-11-08 16:34:26,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 125 [2024-11-08 16:34:29,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 125 [2024-11-08 16:34:40,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 141 [2024-11-08 16:35:04,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 131 [2024-11-08 16:35:43,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 119 [2024-11-08 16:36:26,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 135 [2024-11-08 16:37:13,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127 [2024-11-08 16:37:37,469 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 130 treesize of output 116 [2024-11-08 16:37:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 152 refuted. 92 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 16:37:38,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:37:45,227 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-08 16:37:45,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:37:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425328205] [2024-11-08 16:37:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425328205] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:37:45,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:37:45,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2024-11-08 16:37:45,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925024007] [2024-11-08 16:37:45,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:45,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:37:45,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:37:45,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:37:45,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=126, Unknown=36, NotChecked=0, Total=210 [2024-11-08 16:37:45,229 INFO L87 Difference]: Start difference. First operand 466 states and 660 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-08 16:37:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:55,763 INFO L93 Difference]: Finished difference Result 900 states and 1272 transitions. [2024-11-08 16:37:55,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:37:55,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-08 16:37:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:55,772 INFO L225 Difference]: With dead ends: 900 [2024-11-08 16:37:55,772 INFO L226 Difference]: Without dead ends: 470 [2024-11-08 16:37:55,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 190.8s TimeCoverageRelationStatistics Valid=52, Invalid=152, Unknown=36, NotChecked=0, Total=240 [2024-11-08 16:37:55,774 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 96 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:55,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 247 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-11-08 16:37:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-08 16:37:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2024-11-08 16:37:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 403 states have (on average 1.3548387096774193) internal successors, (546), 407 states have internal predecessors, (546), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 16:37:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 658 transitions. [2024-11-08 16:37:55,806 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 658 transitions. Word has length 108 [2024-11-08 16:37:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:55,807 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 658 transitions. [2024-11-08 16:37:55,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-08 16:37:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 658 transitions. [2024-11-08 16:37:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 16:37:55,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:55,809 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-08 16:37:55,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 16:37:56,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:37:56,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:37:56,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:56,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1923624165, now seen corresponding path program 1 times [2024-11-08 16:37:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:37:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248112306] [2024-11-08 16:37:56,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:56,011 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-08 16:37:56,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:37:56,014 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:37:56,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:37:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:56,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 16:37:56,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:56,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 16:38:00,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2024-11-08 16:38:06,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:06,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2024-11-08 16:38:17,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:17,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 59 [2024-11-08 16:38:21,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:21,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 59 [2024-11-08 16:38:24,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:24,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 70 [2024-11-08 16:38:27,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:27,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 118 treesize of output 52 [2024-11-08 16:38:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 162 proven. 24 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-08 16:38:29,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:38:33,815 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-08 16:38:33,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:38:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248112306] [2024-11-08 16:38:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248112306] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:38:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:38:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 18 [2024-11-08 16:38:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730842496] [2024-11-08 16:38:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:33,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:38:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:38:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:38:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2024-11-08 16:38:33,818 INFO L87 Difference]: Start difference. First operand 466 states and 658 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-08 16:38:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:44,019 INFO L93 Difference]: Finished difference Result 977 states and 1370 transitions. [2024-11-08 16:38:44,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:38:44,025 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-08 16:38:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:44,030 INFO L225 Difference]: With dead ends: 977 [2024-11-08 16:38:44,030 INFO L226 Difference]: Without dead ends: 547 [2024-11-08 16:38:44,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=62, Invalid=355, Unknown=3, NotChecked=0, Total=420 [2024-11-08 16:38:44,032 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 77 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:44,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 548 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-08 16:38:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-08 16:38:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 542. [2024-11-08 16:38:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 471 states have (on average 1.3439490445859872) internal successors, (633), 476 states have internal predecessors, (633), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 16:38:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 757 transitions. [2024-11-08 16:38:44,083 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 757 transitions. Word has length 108 [2024-11-08 16:38:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:44,084 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 757 transitions. [2024-11-08 16:38:44,084 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-08 16:38:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 757 transitions. [2024-11-08 16:38:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:38:44,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:44,086 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-08 16:38:44,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:38:44,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:38:44,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:44,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1934384634, now seen corresponding path program 1 times [2024-11-08 16:38:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:38:44,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972446896] [2024-11-08 16:38:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:44,288 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-08 16:38:44,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:38:44,289 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:38:44,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:38:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:44,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 16:38:44,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:38:44,742 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 14 treesize of output 10 [2024-11-08 16:38:45,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-08 16:38:46,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 16:38:48,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:48,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2024-11-08 16:38:51,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:51,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 40 [2024-11-08 16:38:52,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:52,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 40 [2024-11-08 16:38:54,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:54,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2024-11-08 16:38:58,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:58,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 64 [2024-11-08 16:39:01,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:01,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 82 [2024-11-08 16:39:05,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:05,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 91 [2024-11-08 16:39:07,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:07,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 84 treesize of output 38 [2024-11-08 16:39:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 16:39:08,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:39:08,540 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:39:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972446896] [2024-11-08 16:39:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972446896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:39:08,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:39:08,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:39:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777714719] [2024-11-08 16:39:08,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:39:08,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:39:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:39:08,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:39:08,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:39:08,543 INFO L87 Difference]: Start difference. First operand 542 states and 757 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 16:39:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:39:37,473 INFO L93 Difference]: Finished difference Result 1005 states and 1404 transitions. [2024-11-08 16:39:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:39:37,475 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 109 [2024-11-08 16:39:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:39:37,478 INFO L225 Difference]: With dead ends: 1005 [2024-11-08 16:39:37,479 INFO L226 Difference]: Without dead ends: 670 [2024-11-08 16:39:37,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:39:37,481 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 617 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:39:37,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 460 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 27.4s Time] [2024-11-08 16:39:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-08 16:39:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 439. [2024-11-08 16:39:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 385 states have (on average 1.3584415584415583) internal successors, (523), 388 states have internal predecessors, (523), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:39:37,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 615 transitions. [2024-11-08 16:39:37,528 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 615 transitions. Word has length 109 [2024-11-08 16:39:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:39:37,529 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 615 transitions. [2024-11-08 16:39:37,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 16:39:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 615 transitions. [2024-11-08 16:39:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:39:37,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:39:37,531 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-08 16:39:37,540 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 16:39:37,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:39:37,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:39:37,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:39:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1349465412, now seen corresponding path program 1 times [2024-11-08 16:39:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:39:37,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773658872] [2024-11-08 16:39:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:39:37,733 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-08 16:39:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:39:37,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:39:37,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:39:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:39:38,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 16:39:38,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:39:38,485 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-08 16:39:39,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:39,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 16:39:39,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:39,635 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 34 treesize of output 14 [2024-11-08 16:39:41,372 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-08 16:39:41,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:39:41,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:39:41,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773658872] [2024-11-08 16:39:41,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773658872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:39:41,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:39:41,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:39:41,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261799255] [2024-11-08 16:39:41,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:39:41,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:39:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:39:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:39:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:39:41,375 INFO L87 Difference]: Start difference. First operand 439 states and 615 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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-08 16:39:47,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:39:53,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:40:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:40:17,536 INFO L93 Difference]: Finished difference Result 852 states and 1193 transitions. [2024-11-08 16:40:17,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:40:17,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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-08 16:40:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:40:17,541 INFO L225 Difference]: With dead ends: 852 [2024-11-08 16:40:17,541 INFO L226 Difference]: Without dead ends: 620 [2024-11-08 16:40:17,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:40:17,543 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 204 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:40:17,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1530 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 729 Invalid, 1 Unknown, 0 Unchecked, 33.0s Time] [2024-11-08 16:40:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-08 16:40:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 441. [2024-11-08 16:40:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 387 states have (on average 1.3565891472868217) internal successors, (525), 390 states have internal predecessors, (525), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:40:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 617 transitions. [2024-11-08 16:40:17,593 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 617 transitions. Word has length 109 [2024-11-08 16:40:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:40:17,594 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 617 transitions. [2024-11-08 16:40:17,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 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-08 16:40:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 617 transitions. [2024-11-08 16:40:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:40:17,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:40:17,596 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-08 16:40:17,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:40:17,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:40:17,800 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:40:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:40:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1800371128, now seen corresponding path program 1 times [2024-11-08 16:40:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:40:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121777444] [2024-11-08 16:40:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:40:17,801 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-08 16:40:17,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:40:17,802 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:40:17,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:40:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:40:18,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 16:40:18,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:40:18,281 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-08 16:40:18,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-11-08 16:40:20,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:40:20,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49 [2024-11-08 16:40:21,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:40:21,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 27 [2024-11-08 16:40:23,610 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-08 16:40:23,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:40:23,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:40:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121777444] [2024-11-08 16:40:23,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121777444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:40:23,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:40:23,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:40:23,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948691239] [2024-11-08 16:40:23,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:40:23,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:40:23,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:40:23,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:40:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:40:23,613 INFO L87 Difference]: Start difference. First operand 441 states and 617 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-08 16:40:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:40:54,356 INFO L93 Difference]: Finished difference Result 769 states and 1074 transitions. [2024-11-08 16:40:54,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:40:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-08 16:40:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:40:54,361 INFO L225 Difference]: With dead ends: 769 [2024-11-08 16:40:54,361 INFO L226 Difference]: Without dead ends: 535 [2024-11-08 16:40:54,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:40:54,362 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 143 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:40:54,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1120 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 28.4s Time] [2024-11-08 16:40:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-08 16:40:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 441. [2024-11-08 16:40:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 387 states have (on average 1.3565891472868217) internal successors, (525), 390 states have internal predecessors, (525), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:40:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 617 transitions. [2024-11-08 16:40:54,407 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 617 transitions. Word has length 109 [2024-11-08 16:40:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:40:54,408 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 617 transitions. [2024-11-08 16:40:54,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 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-08 16:40:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 617 transitions. [2024-11-08 16:40:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:40:54,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:40:54,410 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-08 16:40:54,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 16:40:54,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:40:54,610 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:40:54,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:40:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1483478918, now seen corresponding path program 1 times [2024-11-08 16:40:54,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:40:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062884340] [2024-11-08 16:40:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:40:54,611 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-08 16:40:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:40:54,612 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:40:54,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:40:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:40:55,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:40:55,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:40:55,106 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-08 16:40:55,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 16:40:56,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:40:56,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-08 16:40:57,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:40:57,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2024-11-08 16:40:58,039 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-08 16:40:58,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:40:58,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:40:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062884340] [2024-11-08 16:40:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062884340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:40:58,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:40:58,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:40:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780346275] [2024-11-08 16:40:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:40:58,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:40:58,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:40:58,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:40:58,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:40:58,041 INFO L87 Difference]: Start difference. First operand 441 states and 617 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-08 16:41:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:20,780 INFO L93 Difference]: Finished difference Result 758 states and 1061 transitions. [2024-11-08 16:41:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:41:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-08 16:41:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:20,783 INFO L225 Difference]: With dead ends: 758 [2024-11-08 16:41:20,783 INFO L226 Difference]: Without dead ends: 524 [2024-11-08 16:41:20,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:41:20,785 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 134 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:41:20,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 774 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 21.8s Time] [2024-11-08 16:41:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-08 16:41:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 436. [2024-11-08 16:41:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 382 states have (on average 1.3534031413612566) internal successors, (517), 385 states have internal predecessors, (517), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:41:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 609 transitions. [2024-11-08 16:41:20,829 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 609 transitions. Word has length 109 [2024-11-08 16:41:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:20,830 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 609 transitions. [2024-11-08 16:41:20,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-08 16:41:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 609 transitions. [2024-11-08 16:41:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 16:41:20,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:20,831 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-08 16:41:20,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:41:21,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:41:21,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:21,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1337407117, now seen corresponding path program 1 times [2024-11-08 16:41:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:41:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338273867] [2024-11-08 16:41:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:21,033 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-08 16:41:21,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:41:21,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:41:21,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:41:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:21,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 16:41:21,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:41:21,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 16:41:21,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2024-11-08 16:41:22,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:41:22,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 16:41:24,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:41:24,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 32 [2024-11-08 16:41:25,503 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-08 16:41:25,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:41:25,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:41:25,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338273867] [2024-11-08 16:41:25,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338273867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:41:25,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:41:25,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:41:25,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403092809] [2024-11-08 16:41:25,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:41:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:41:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:41:25,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:41:25,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:41:25,506 INFO L87 Difference]: Start difference. First operand 436 states and 609 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-08 16:41:31,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:41:47,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:41:47,202 INFO L93 Difference]: Finished difference Result 455 states and 630 transitions. [2024-11-08 16:41:47,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:41:47,203 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-08 16:41:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:41:47,205 INFO L225 Difference]: With dead ends: 455 [2024-11-08 16:41:47,205 INFO L226 Difference]: Without dead ends: 453 [2024-11-08 16:41:47,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:41:47,206 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 190 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:41:47,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 669 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 19.8s Time] [2024-11-08 16:41:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-08 16:41:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 448. [2024-11-08 16:41:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 394 states have (on average 1.3426395939086295) internal successors, (529), 397 states have internal predecessors, (529), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 16:41:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 621 transitions. [2024-11-08 16:41:47,254 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 621 transitions. Word has length 110 [2024-11-08 16:41:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:41:47,256 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 621 transitions. [2024-11-08 16:41:47,256 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-08 16:41:47,257 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 621 transitions. [2024-11-08 16:41:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 16:41:47,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:41:47,258 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-08 16:41:47,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:41:47,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:41:47,458 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:41:47,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:41:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1339254159, now seen corresponding path program 1 times [2024-11-08 16:41:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:41:47,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439269545] [2024-11-08 16:41:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:41:47,459 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-08 16:41:47,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:41:47,460 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:41:47,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:41:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:41:47,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 16:41:47,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:41:51,432 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-08 16:41:55,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:41:55,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 59 [2024-11-08 16:41:57,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:41:57,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2024-11-08 16:42:00,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:42:00,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 100 [2024-11-08 16:42:09,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:42:09,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 111 [2024-11-08 16:42:28,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:42:28,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 368 treesize of output 122 [2024-11-08 16:42:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 16:42:31,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:42:31,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:42:31,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439269545] [2024-11-08 16:42:31,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439269545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:42:31,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:42:31,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:42:31,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811911669] [2024-11-08 16:42:31,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:42:31,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:42:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:42:31,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:42:31,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:42:31,283 INFO L87 Difference]: Start difference. First operand 448 states and 621 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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-08 16:42:53,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:42:58,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:43:09,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:43:18,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:43:23,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:43:25,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:43:38,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:07,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:10,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:14,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:29,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:33,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:44:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:39,028 INFO L93 Difference]: Finished difference Result 1531 states and 2112 transitions. [2024-11-08 16:44:39,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:44:39,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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 110 [2024-11-08 16:44:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:39,038 INFO L225 Difference]: With dead ends: 1531 [2024-11-08 16:44:39,038 INFO L226 Difference]: Without dead ends: 1123 [2024-11-08 16:44:39,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:44:39,040 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 488 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 23 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 112.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 115.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:39,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 641 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 939 Invalid, 7 Unknown, 0 Unchecked, 115.2s Time] [2024-11-08 16:44:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2024-11-08 16:44:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1077. [2024-11-08 16:44:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 973 states have (on average 1.3494347379239466) internal successors, (1313), 983 states have internal predecessors, (1313), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 78 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-08 16:44:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1489 transitions. [2024-11-08 16:44:39,155 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1489 transitions. Word has length 110 [2024-11-08 16:44:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:39,155 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1489 transitions. [2024-11-08 16:44:39,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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-08 16:44:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1489 transitions. [2024-11-08 16:44:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 16:44:39,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:39,158 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-08 16:44:39,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:44:39,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:39,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:39,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:39,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1180705775, now seen corresponding path program 1 times [2024-11-08 16:44:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514332945] [2024-11-08 16:44:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:39,360 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-08 16:44:39,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:39,361 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:39,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:39,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:44:39,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:40,515 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-08 16:44:40,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:40,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514332945] [2024-11-08 16:44:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514332945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:40,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:40,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:44:40,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082356649] [2024-11-08 16:44:40,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:40,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:44:40,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:44:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:44:40,517 INFO L87 Difference]: Start difference. First operand 1077 states and 1489 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-08 16:44:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:41,711 INFO L93 Difference]: Finished difference Result 2138 states and 2953 transitions. [2024-11-08 16:44:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:44:41,712 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-08 16:44:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:41,718 INFO L225 Difference]: With dead ends: 2138 [2024-11-08 16:44:41,718 INFO L226 Difference]: Without dead ends: 1113 [2024-11-08 16:44:41,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:44:41,721 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:41,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 592 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:44:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-08 16:44:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2024-11-08 16:44:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1009 states have (on average 1.3369672943508424) internal successors, (1349), 1019 states have internal predecessors, (1349), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 78 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-08 16:44:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1525 transitions. [2024-11-08 16:44:41,832 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1525 transitions. Word has length 110 [2024-11-08 16:44:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:41,833 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1525 transitions. [2024-11-08 16:44:41,833 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-08 16:44:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1525 transitions. [2024-11-08 16:44:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 16:44:41,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:41,836 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-08 16:44:41,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:42,037 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:42,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1694795887, now seen corresponding path program 1 times [2024-11-08 16:44:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763387245] [2024-11-08 16:44:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:42,039 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-08 16:44:42,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:42,043 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:42,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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)] Waiting until timeout for monitored process [2024-11-08 16:44:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:42,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:44:42,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 16:44:43,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:43,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763387245] [2024-11-08 16:44:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763387245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:43,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:44:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991279561] [2024-11-08 16:44:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:43,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:44:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:43,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:44:43,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:44:43,113 INFO L87 Difference]: Start difference. First operand 1113 states and 1525 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-08 16:44:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:44,039 INFO L93 Difference]: Finished difference Result 2184 states and 2992 transitions. [2024-11-08 16:44:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:44:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 110 [2024-11-08 16:44:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:44,058 INFO L225 Difference]: With dead ends: 2184 [2024-11-08 16:44:44,058 INFO L226 Difference]: Without dead ends: 1113 [2024-11-08 16:44:44,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:44:44,063 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:44,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:44:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-08 16:44:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2024-11-08 16:44:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1009 states have (on average 1.333994053518335) internal successors, (1346), 1019 states have internal predecessors, (1346), 88 states have call successors, (88), 15 states have call predecessors, (88), 15 states have return successors, (88), 78 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-08 16:44:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1522 transitions. [2024-11-08 16:44:44,186 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1522 transitions. Word has length 110 [2024-11-08 16:44:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:44,186 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1522 transitions. [2024-11-08 16:44:44,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-08 16:44:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1522 transitions. [2024-11-08 16:44:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 16:44:44,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:44,189 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-08 16:44:44,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 16:44:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:44,390 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:44,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash 618215092, now seen corresponding path program 1 times [2024-11-08 16:44:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:44,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089873513] [2024-11-08 16:44:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:44,392 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-08 16:44:44,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:44,396 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:44,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:44,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 16:44:44,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:45,955 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 28 treesize of output 16 [2024-11-08 16:44:46,647 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-08 16:44:46,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:44:46,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:44:46,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089873513] [2024-11-08 16:44:46,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089873513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:44:46,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:44:46,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:44:46,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874364343] [2024-11-08 16:44:46,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:44:46,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:44:46,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:44:46,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:44:46,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:44:46,650 INFO L87 Difference]: Start difference. First operand 1113 states and 1522 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-08 16:44:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:55,631 INFO L93 Difference]: Finished difference Result 2026 states and 2768 transitions. [2024-11-08 16:44:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:44:55,632 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-08 16:44:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:55,637 INFO L225 Difference]: With dead ends: 2026 [2024-11-08 16:44:55,637 INFO L226 Difference]: Without dead ends: 965 [2024-11-08 16:44:55,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:44:55,640 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:55,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-08 16:44:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-08 16:44:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2024-11-08 16:44:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 873 states have (on average 1.3218785796105383) internal successors, (1154), 881 states have internal predecessors, (1154), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-08 16:44:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1306 transitions. [2024-11-08 16:44:55,752 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1306 transitions. Word has length 111 [2024-11-08 16:44:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:55,752 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1306 transitions. [2024-11-08 16:44:55,753 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-08 16:44:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1306 transitions. [2024-11-08 16:44:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 16:44:55,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:55,756 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-08 16:44:55,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 16:44:55,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:55,960 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:44:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2089327278, now seen corresponding path program 1 times [2024-11-08 16:44:55,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:44:55,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410297908] [2024-11-08 16:44:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:44:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:44:55,962 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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-08 16:44:55,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a1dbbf-199d-4e13-a8ca-ae9e2df6fac0/bin/uautomizer-verify-jihMAELWvX/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 (20)] Waiting until timeout for monitored process [2024-11-08 16:44:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:56,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 16:44:56,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:56,609 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-08 16:44:58,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-08 16:45:00,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:45:00,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 48 [2024-11-08 16:45:08,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:45:08,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 74 [2024-11-08 16:45:21,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:45:21,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-11-08 16:45:26,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:45:26,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 80 [2024-11-08 16:45:27,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:45:27,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 30 [2024-11-08 16:45:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 185 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 16:45:28,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:45:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 16:45:36,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:45:36,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410297908] [2024-11-08 16:45:36,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410297908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:45:36,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:45:36,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-08 16:45:36,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78633534] [2024-11-08 16:45:36,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:45:36,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:45:36,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:45:36,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:45:36,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=129, Unknown=3, NotChecked=0, Total=182 [2024-11-08 16:45:36,382 INFO L87 Difference]: Start difference. First operand 965 states and 1306 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 14 states have internal predecessors, (88), 7 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2024-11-08 16:45:48,542 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-08 16:45:52,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:45:56,740 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-08 16:46:00,787 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-08 16:46:04,831 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-08 16:46:08,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:46:25,337 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-08 16:46:29,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:46:45,831 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-08 16:46:49,841 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-08 16:46:53,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:46:58,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:47:02,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:47:06,225 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-08 16:47:10,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]