./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.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_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:27:27,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:27:27,858 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:27:27,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:27:27,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:27:27,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:27:27,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:27:27,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:27:27,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:27:27,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:27:27,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:27:27,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:27:27,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:27:27,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:27:27,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:27:27,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:27:27,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:27:27,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:27:27,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:27:27,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:27:27,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:27:27,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:27:27,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:27:27,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:27:27,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:27:27,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:27:27,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:27:27,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:27:27,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:27:27,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:27:27,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:27:27,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:27:27,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:27:27,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:27:27,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:27:27,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:27:27,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:27:27,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:27:27,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:27:27,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:27:27,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:27:27,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:27:27,951 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_a1d5211a-3794-4a62-8b6a-76d1d343693e/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_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 -> 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a [2024-11-08 18:27:28,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:27:28,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:27:28,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:27:28,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:27:28,332 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:27:28,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i Unable to find full path for "g++" [2024-11-08 18:27:30,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:27:30,990 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:27:30,990 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-08 18:27:31,005 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/data/69be4af2b/a049a35ccac44992a58ce36145729b23/FLAGa2fb893bc [2024-11-08 18:27:31,320 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/data/69be4af2b/a049a35ccac44992a58ce36145729b23 [2024-11-08 18:27:31,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:27:31,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:27:31,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:27:31,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:27:31,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:27:31,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2b2d6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31, skipping insertion in model container [2024-11-08 18:27:31,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:27:31,561 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_a1d5211a-3794-4a62-8b6a-76d1d343693e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-11-08 18:27:31,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:27:31,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:27:31,686 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_a1d5211a-3794-4a62-8b6a-76d1d343693e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-11-08 18:27:31,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:27:31,768 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:27:31,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31 WrapperNode [2024-11-08 18:27:31,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:27:31,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:27:31,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:27:31,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:27:31,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,859 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2024-11-08 18:27:31,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:27:31,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:27:31,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:27:31,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:27:31,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,890 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 18:27:31,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:27:31,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:27:31,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:27:31,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:27:31,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (1/1) ... [2024-11-08 18:27:31,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:27:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:27:31,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:27:31,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:27:32,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:27:32,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 18:27:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 18:27:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 18:27:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 18:27:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 18:27:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 18:27:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:27:32,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:27:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 18:27:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:27:32,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:27:32,224 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:27:32,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:27:33,053 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-08 18:27:33,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:27:33,080 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:27:33,080 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:27:33,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:27:33 BoogieIcfgContainer [2024-11-08 18:27:33,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:27:33,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:27:33,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:27:33,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:27:33,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:27:31" (1/3) ... [2024-11-08 18:27:33,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755aafb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:27:33, skipping insertion in model container [2024-11-08 18:27:33,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:27:31" (2/3) ... [2024-11-08 18:27:33,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755aafb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:27:33, skipping insertion in model container [2024-11-08 18:27:33,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:27:33" (3/3) ... [2024-11-08 18:27:33,098 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-08 18:27:33,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:27:33,124 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:27:33,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:27:33,225 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;@3d71b178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:27:33,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:27:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 18:27:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 18:27:33,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:33,253 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:27:33,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:27:33,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:33,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1253531368, now seen corresponding path program 1 times [2024-11-08 18:27:33,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:33,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631054498] [2024-11-08 18:27:33,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:33,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:27:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:27:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:27:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:27:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:27:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:27:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:27:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:27:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:27:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:27:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:27:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:27:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:27:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:27:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:27:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:27:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:27:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:27:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:27:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:27:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:27:35,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:35,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631054498] [2024-11-08 18:27:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631054498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:27:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556314645] [2024-11-08 18:27:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:35,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:27:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:35,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:27:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:27:35,505 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:27:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:36,205 INFO L93 Difference]: Finished difference Result 296 states and 475 transitions. [2024-11-08 18:27:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:27:36,211 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-08 18:27:36,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:36,227 INFO L225 Difference]: With dead ends: 296 [2024-11-08 18:27:36,227 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 18:27:36,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:27:36,240 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 106 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:36,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 423 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:27:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 18:27:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 167. [2024-11-08 18:27:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 124 states have internal predecessors, (158), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 18:27:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 238 transitions. [2024-11-08 18:27:36,327 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 238 transitions. Word has length 150 [2024-11-08 18:27:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:36,329 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 238 transitions. [2024-11-08 18:27:36,329 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:27:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 238 transitions. [2024-11-08 18:27:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 18:27:36,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:36,335 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:27:36,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:27:36,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:27:36,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1691917130, now seen corresponding path program 1 times [2024-11-08 18:27:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:36,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248439799] [2024-11-08 18:27:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:27:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:27:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:27:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:27:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:27:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:27:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:27:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:27:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:27:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:27:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:27:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:27:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:27:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:27:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:27:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:27:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:27:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:27:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:27:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:27:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:27:36,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:36,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248439799] [2024-11-08 18:27:36,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248439799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:36,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:36,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:27:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517788464] [2024-11-08 18:27:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:36,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:27:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:36,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:27:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:27:36,829 INFO L87 Difference]: Start difference. First operand 167 states and 238 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:27:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:36,912 INFO L93 Difference]: Finished difference Result 266 states and 380 transitions. [2024-11-08 18:27:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:27:36,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2024-11-08 18:27:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:36,923 INFO L225 Difference]: With dead ends: 266 [2024-11-08 18:27:36,923 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 18:27:36,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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 18:27:36,925 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:36,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:27:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 18:27:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2024-11-08 18:27:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 126 states have internal predecessors, (160), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 18:27:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2024-11-08 18:27:36,978 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 158 [2024-11-08 18:27:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:36,979 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2024-11-08 18:27:36,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:27:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2024-11-08 18:27:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 18:27:36,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:36,990 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:27:36,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:27:36,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:27:36,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1690070088, now seen corresponding path program 1 times [2024-11-08 18:27:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:36,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816143265] [2024-11-08 18:27:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:27:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:27:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:27:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:27:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:27:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:27:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:27:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:27:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:27:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:27:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:27:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:27:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:27:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:27:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:27:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:27:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:27:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:27:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:27:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:27:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:27:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:27:46,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:27:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816143265] [2024-11-08 18:27:46,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816143265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:27:46,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:27:46,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 18:27:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272427494] [2024-11-08 18:27:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:27:46,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:27:46,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:27:46,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:27:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:27:46,774 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:27:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:27:50,680 INFO L93 Difference]: Finished difference Result 322 states and 456 transitions. [2024-11-08 18:27:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:27:50,681 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 158 [2024-11-08 18:27:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:27:50,686 INFO L225 Difference]: With dead ends: 322 [2024-11-08 18:27:50,686 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 18:27:50,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:27:50,688 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 380 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:27:50,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 720 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 18:27:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 18:27:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 195. [2024-11-08 18:27:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 152 states have internal predecessors, (197), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 18:27:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2024-11-08 18:27:50,784 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 158 [2024-11-08 18:27:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:27:50,785 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2024-11-08 18:27:50,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:27:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2024-11-08 18:27:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 18:27:50,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:27:50,793 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:27:50,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:27:50,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:27:50,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:27:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1431489574, now seen corresponding path program 1 times [2024-11-08 18:27:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:27:50,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159636953] [2024-11-08 18:27:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:27:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:27:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:28:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:28:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:28:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:28:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:28:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:28:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:28:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:28:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:00,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:28:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:28:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:28:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:28:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:28:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:28:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:28:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:28:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:28:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:28:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:28:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:28:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:28:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:01,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159636953] [2024-11-08 18:28:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159636953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:01,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:01,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 18:28:01,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65728737] [2024-11-08 18:28:01,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:01,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:28:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:01,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:28:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:28:01,301 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:28:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:05,008 INFO L93 Difference]: Finished difference Result 348 states and 492 transitions. [2024-11-08 18:28:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:28:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 159 [2024-11-08 18:28:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:05,013 INFO L225 Difference]: With dead ends: 348 [2024-11-08 18:28:05,014 INFO L226 Difference]: Without dead ends: 234 [2024-11-08 18:28:05,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2024-11-08 18:28:05,017 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 279 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:05,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 590 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 18:28:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-08 18:28:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 195. [2024-11-08 18:28:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 152 states have internal predecessors, (197), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 18:28:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2024-11-08 18:28:05,072 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 159 [2024-11-08 18:28:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:05,074 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2024-11-08 18:28:05,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:28:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2024-11-08 18:28:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:28:05,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:05,078 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:28:05,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:28:05,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:28:05,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash 797706429, now seen corresponding path program 1 times [2024-11-08 18:28:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:05,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72012974] [2024-11-08 18:28:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:28:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:28:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:28:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:28:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:28:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:28:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:28:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:28:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:28:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:28:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:28:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:28:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:28:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:28:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:28:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:28:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:28:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:28:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:28:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:28:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:28:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72012974] [2024-11-08 18:28:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72012974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:14,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:14,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 18:28:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467726338] [2024-11-08 18:28:14,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:14,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:28:14,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:14,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:28:14,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:28:14,604 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 18 states, 15 states have (on average 4.2) internal successors, (63), 18 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:28:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:18,948 INFO L93 Difference]: Finished difference Result 362 states and 506 transitions. [2024-11-08 18:28:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:28:18,950 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.2) internal successors, (63), 18 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) Word has length 160 [2024-11-08 18:28:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:18,953 INFO L225 Difference]: With dead ends: 362 [2024-11-08 18:28:18,954 INFO L226 Difference]: Without dead ends: 248 [2024-11-08 18:28:18,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2024-11-08 18:28:18,957 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 281 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:18,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 610 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 18:28:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-08 18:28:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2024-11-08 18:28:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 198 states have (on average 1.292929292929293) internal successors, (256), 199 states have internal predecessors, (256), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:28:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 340 transitions. [2024-11-08 18:28:19,038 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 340 transitions. Word has length 160 [2024-11-08 18:28:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:19,038 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 340 transitions. [2024-11-08 18:28:19,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.2) internal successors, (63), 18 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:28:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 340 transitions. [2024-11-08 18:28:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:28:19,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:19,041 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:28:19,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:28:19,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:28:19,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2056512301, now seen corresponding path program 1 times [2024-11-08 18:28:19,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:19,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341738954] [2024-11-08 18:28:19,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:19,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:28:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:28:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:28:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:28:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:28:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:28:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:28:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:28:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:28:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:28:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:28:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:28:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:28:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:28:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:28:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:28:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:28:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:28:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:28:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:28:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:28:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341738954] [2024-11-08 18:28:24,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341738954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:24,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:24,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:28:24,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554598181] [2024-11-08 18:28:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:24,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:28:24,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:28:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:28:24,336 INFO L87 Difference]: Start difference. First operand 245 states and 340 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 18:28:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:27,379 INFO L93 Difference]: Finished difference Result 566 states and 784 transitions. [2024-11-08 18:28:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:28:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-08 18:28:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:27,387 INFO L225 Difference]: With dead ends: 566 [2024-11-08 18:28:27,388 INFO L226 Difference]: Without dead ends: 408 [2024-11-08 18:28:27,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:28:27,391 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 395 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:27,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 604 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 18:28:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-08 18:28:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 302. [2024-11-08 18:28:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 255 states have (on average 1.3215686274509804) internal successors, (337), 256 states have internal predecessors, (337), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:28:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 421 transitions. [2024-11-08 18:28:27,505 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 421 transitions. Word has length 160 [2024-11-08 18:28:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:27,506 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 421 transitions. [2024-11-08 18:28:27,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 18:28:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 421 transitions. [2024-11-08 18:28:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:28:27,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:27,510 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:28:27,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:28:27,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:28:27,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1196438277, now seen corresponding path program 1 times [2024-11-08 18:28:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:27,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49087564] [2024-11-08 18:28:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:28:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:28:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:28:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:28:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:28:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:28:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:28:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:28:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:28:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:28:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:28:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:28:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:28:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:28:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:28:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:28:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:28:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:28:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:28:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:28:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:28:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49087564] [2024-11-08 18:28:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49087564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:28,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:28,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:28:28,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664938472] [2024-11-08 18:28:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:28,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:28:28,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:28,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:28:28,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:28:28,205 INFO L87 Difference]: Start difference. First operand 302 states and 421 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:28:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:28,913 INFO L93 Difference]: Finished difference Result 511 states and 716 transitions. [2024-11-08 18:28:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:28:28,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-08 18:28:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:28,917 INFO L225 Difference]: With dead ends: 511 [2024-11-08 18:28:28,917 INFO L226 Difference]: Without dead ends: 310 [2024-11-08 18:28:28,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 18:28:28,919 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:28,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:28:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-08 18:28:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-08 18:28:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 263 states have (on average 1.3155893536121672) internal successors, (346), 264 states have internal predecessors, (346), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:28:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 430 transitions. [2024-11-08 18:28:29,019 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 430 transitions. Word has length 160 [2024-11-08 18:28:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:29,020 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 430 transitions. [2024-11-08 18:28:29,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:28:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 430 transitions. [2024-11-08 18:28:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:28:29,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:29,023 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:28:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:28:29,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:28:29,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1818665341, now seen corresponding path program 1 times [2024-11-08 18:28:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741065540] [2024-11-08 18:28:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:28:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:28:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:28:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:28:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:28:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:28:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:28:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:28:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:28:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:28:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:28:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:28:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:28:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:28:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:28:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:28:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:28:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:28:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:28:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:28:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:28:35,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:35,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741065540] [2024-11-08 18:28:35,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741065540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:35,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:35,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:28:35,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645985116] [2024-11-08 18:28:35,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:35,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:28:35,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:28:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:28:35,674 INFO L87 Difference]: Start difference. First operand 310 states and 430 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:28:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:40,148 INFO L93 Difference]: Finished difference Result 613 states and 848 transitions. [2024-11-08 18:28:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:28:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-08 18:28:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:40,155 INFO L225 Difference]: With dead ends: 613 [2024-11-08 18:28:40,156 INFO L226 Difference]: Without dead ends: 404 [2024-11-08 18:28:40,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:28:40,158 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 270 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:40,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 589 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 18:28:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-08 18:28:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 350. [2024-11-08 18:28:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 303 states have (on average 1.33993399339934) internal successors, (406), 304 states have internal predecessors, (406), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:28:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 490 transitions. [2024-11-08 18:28:40,277 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 490 transitions. Word has length 160 [2024-11-08 18:28:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:40,278 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 490 transitions. [2024-11-08 18:28:40,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:28:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 490 transitions. [2024-11-08 18:28:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:28:40,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:40,280 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:28:40,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:28:40,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:28:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1915963691, now seen corresponding path program 1 times [2024-11-08 18:28:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:40,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577956408] [2024-11-08 18:28:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:28:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:28:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:28:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:28:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:28:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:28:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:28:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:28:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:28:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:28:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:28:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:28:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:28:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:28:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:28:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:28:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:28:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:28:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:28:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:28:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:28:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577956408] [2024-11-08 18:28:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577956408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:41,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:28:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604722606] [2024-11-08 18:28:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:41,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:28:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:41,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:28:41,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:28:41,360 INFO L87 Difference]: Start difference. First operand 350 states and 490 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 18:28:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:42,722 INFO L93 Difference]: Finished difference Result 643 states and 897 transitions. [2024-11-08 18:28:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:28:42,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-11-08 18:28:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:42,730 INFO L225 Difference]: With dead ends: 643 [2024-11-08 18:28:42,730 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 18:28:42,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:28:42,732 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 208 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:42,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 389 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 18:28:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 18:28:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 365. [2024-11-08 18:28:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 318 states have (on average 1.3396226415094339) internal successors, (426), 319 states have internal predecessors, (426), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:28:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 510 transitions. [2024-11-08 18:28:42,837 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 510 transitions. Word has length 160 [2024-11-08 18:28:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:42,838 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 510 transitions. [2024-11-08 18:28:42,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 18:28:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 510 transitions. [2024-11-08 18:28:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:28:42,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:42,844 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:28:42,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:28:42,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:28:42,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash -779693859, now seen corresponding path program 1 times [2024-11-08 18:28:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:42,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007067262] [2024-11-08 18:28:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:28:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:28:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:28:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:28:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:28:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:28:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:28:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:28:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:28:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:28:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:28:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:28:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:28:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:28:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:28:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:28:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:28:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:28:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:28:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:28:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:28:48,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:48,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007067262] [2024-11-08 18:28:48,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007067262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:48,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:48,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:28:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467339004] [2024-11-08 18:28:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:48,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:28:48,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:48,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:28:48,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:28:48,505 INFO L87 Difference]: Start difference. First operand 365 states and 510 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:28:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:28:51,476 INFO L93 Difference]: Finished difference Result 703 states and 983 transitions. [2024-11-08 18:28:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:28:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-08 18:28:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:28:51,481 INFO L225 Difference]: With dead ends: 703 [2024-11-08 18:28:51,481 INFO L226 Difference]: Without dead ends: 460 [2024-11-08 18:28:51,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:28:51,483 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 326 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:28:51,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 519 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 18:28:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-08 18:28:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 415. [2024-11-08 18:28:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 368 states have (on average 1.358695652173913) internal successors, (500), 369 states have internal predecessors, (500), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:28:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 584 transitions. [2024-11-08 18:28:51,592 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 584 transitions. Word has length 160 [2024-11-08 18:28:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:28:51,593 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 584 transitions. [2024-11-08 18:28:51,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:28:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 584 transitions. [2024-11-08 18:28:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:28:51,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:28:51,596 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:28:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:28:51,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:28:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:28:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1800762213, now seen corresponding path program 1 times [2024-11-08 18:28:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:28:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230366212] [2024-11-08 18:28:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:28:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:28:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:28:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:28:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:28:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:28:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:28:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:28:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:28:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:28:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:28:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:28:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:28:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:28:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:28:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:28:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:28:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:28:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:28:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:28:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:28:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:28:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:28:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:28:57,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:28:57,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230366212] [2024-11-08 18:28:57,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230366212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:28:57,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:28:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:28:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981852220] [2024-11-08 18:28:57,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:28:57,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:28:57,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:28:57,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:28:57,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:28:57,716 INFO L87 Difference]: Start difference. First operand 415 states and 584 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:29:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:00,645 INFO L93 Difference]: Finished difference Result 728 states and 1020 transitions. [2024-11-08 18:29:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:29:00,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-08 18:29:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:00,649 INFO L225 Difference]: With dead ends: 728 [2024-11-08 18:29:00,649 INFO L226 Difference]: Without dead ends: 454 [2024-11-08 18:29:00,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:29:00,651 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 278 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:00,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 620 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 18:29:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-08 18:29:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 411. [2024-11-08 18:29:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 364 states have (on average 1.3516483516483517) internal successors, (492), 365 states have internal predecessors, (492), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 18:29:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 576 transitions. [2024-11-08 18:29:00,738 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 576 transitions. Word has length 160 [2024-11-08 18:29:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:00,738 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 576 transitions. [2024-11-08 18:29:00,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:29:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 576 transitions. [2024-11-08 18:29:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:29:00,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:00,741 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:00,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:29:00,741 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:29:00,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:00,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1841297595, now seen corresponding path program 1 times [2024-11-08 18:29:00,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:00,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904995796] [2024-11-08 18:29:00,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:00,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:29:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:29:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:29:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:29:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:29:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:29:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:29:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:29:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:29:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:29:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:29:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:29:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:29:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:29:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:29:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:29:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:29:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:29:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:29:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:29:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:29:05,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:05,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904995796] [2024-11-08 18:29:05,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904995796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:29:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:29:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 18:29:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325769274] [2024-11-08 18:29:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:29:05,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:29:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:29:05,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:29:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:29:05,500 INFO L87 Difference]: Start difference. First operand 411 states and 576 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:29:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:10,647 INFO L93 Difference]: Finished difference Result 736 states and 1023 transitions. [2024-11-08 18:29:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:29:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-08 18:29:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:10,651 INFO L225 Difference]: With dead ends: 736 [2024-11-08 18:29:10,651 INFO L226 Difference]: Without dead ends: 466 [2024-11-08 18:29:10,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-08 18:29:10,654 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 198 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:10,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 819 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 18:29:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-08 18:29:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 459. [2024-11-08 18:29:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 406 states have (on average 1.3349753694581281) internal successors, (542), 408 states have internal predecessors, (542), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:29:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 634 transitions. [2024-11-08 18:29:10,789 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 634 transitions. Word has length 160 [2024-11-08 18:29:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:10,790 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 634 transitions. [2024-11-08 18:29:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:29:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 634 transitions. [2024-11-08 18:29:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:29:10,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:10,794 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:10,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:29:10,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:29:10,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash -757061605, now seen corresponding path program 1 times [2024-11-08 18:29:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364353429] [2024-11-08 18:29:10,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:10,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:29:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:29:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:29:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:29:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:29:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:29:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:29:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:29:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:29:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:29:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:29:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:29:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:29:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:29:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:29:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:29:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:29:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:29:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:29:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:29:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:29:11,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364353429] [2024-11-08 18:29:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364353429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:29:11,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:29:11,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:29:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666638807] [2024-11-08 18:29:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:29:11,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:29:11,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:29:11,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:29:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:29:11,972 INFO L87 Difference]: Start difference. First operand 459 states and 634 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 18:29:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:12,990 INFO L93 Difference]: Finished difference Result 797 states and 1100 transitions. [2024-11-08 18:29:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:29:12,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-08 18:29:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:12,996 INFO L225 Difference]: With dead ends: 797 [2024-11-08 18:29:12,996 INFO L226 Difference]: Without dead ends: 459 [2024-11-08 18:29:12,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:29:13,000 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 105 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:13,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 324 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:29:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-08 18:29:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-11-08 18:29:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 406 states have (on average 1.3300492610837438) internal successors, (540), 408 states have internal predecessors, (540), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:29:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 632 transitions. [2024-11-08 18:29:13,125 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 632 transitions. Word has length 160 [2024-11-08 18:29:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:13,126 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 632 transitions. [2024-11-08 18:29:13,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 18:29:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 632 transitions. [2024-11-08 18:29:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:29:13,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:13,129 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:13,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:29:13,130 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:29:13,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:13,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1166166429, now seen corresponding path program 1 times [2024-11-08 18:29:13,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:13,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790911307] [2024-11-08 18:29:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:13,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:29:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:29:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:29:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:29:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:29:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:29:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:29:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:29:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:29:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:29:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:29:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:29:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:29:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:29:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:29:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:29:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:29:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:29:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:29:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:29:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:29:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790911307] [2024-11-08 18:29:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790911307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:29:18,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:29:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:29:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745950392] [2024-11-08 18:29:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:29:18,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:29:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:29:18,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:29:18,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:29:18,513 INFO L87 Difference]: Start difference. First operand 459 states and 632 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:29:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:21,810 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2024-11-08 18:29:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:29:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-08 18:29:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:21,815 INFO L225 Difference]: With dead ends: 886 [2024-11-08 18:29:21,816 INFO L226 Difference]: Without dead ends: 568 [2024-11-08 18:29:21,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:29:21,818 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 230 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:21,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 481 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 18:29:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-08 18:29:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 483. [2024-11-08 18:29:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 430 states have (on average 1.341860465116279) internal successors, (577), 432 states have internal predecessors, (577), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:29:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 669 transitions. [2024-11-08 18:29:21,938 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 669 transitions. Word has length 160 [2024-11-08 18:29:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 669 transitions. [2024-11-08 18:29:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:29:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 669 transitions. [2024-11-08 18:29:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 18:29:21,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:21,941 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:21,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:29:21,941 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:29:21,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 145098075, now seen corresponding path program 1 times [2024-11-08 18:29:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551204386] [2024-11-08 18:29:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:29:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:29:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:29:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:29:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:29:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:29:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:29:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:29:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:29:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:29:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:27,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:29:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:29:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:29:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:29:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:29:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:29:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:29:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:29:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:29:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:29:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:29:28,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:28,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551204386] [2024-11-08 18:29:28,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551204386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:29:28,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:29:28,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:29:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482574323] [2024-11-08 18:29:28,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:29:28,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:29:28,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:29:28,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:29:28,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:29:28,116 INFO L87 Difference]: Start difference. First operand 483 states and 669 transitions. Second operand has 17 states, 14 states have (on average 4.5) internal successors, (63), 17 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:29:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:32,342 INFO L93 Difference]: Finished difference Result 886 states and 1217 transitions. [2024-11-08 18:29:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:29:32,343 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.5) internal successors, (63), 17 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) Word has length 160 [2024-11-08 18:29:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:32,346 INFO L225 Difference]: With dead ends: 886 [2024-11-08 18:29:32,346 INFO L226 Difference]: Without dead ends: 544 [2024-11-08 18:29:32,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:29:32,348 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 225 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:32,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 742 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 18:29:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-08 18:29:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 497. [2024-11-08 18:29:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 443 states have (on average 1.3318284424379232) internal successors, (590), 445 states have internal predecessors, (590), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:29:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 682 transitions. [2024-11-08 18:29:32,471 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 682 transitions. Word has length 160 [2024-11-08 18:29:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:32,472 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 682 transitions. [2024-11-08 18:29:32,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.5) internal successors, (63), 17 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:29:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 682 transitions. [2024-11-08 18:29:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 18:29:32,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:32,475 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:32,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:29:32,475 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:29:32,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1565598293, now seen corresponding path program 1 times [2024-11-08 18:29:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:32,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132955139] [2024-11-08 18:29:32,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:29:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:29:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:29:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:29:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:29:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:29:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:29:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:29:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:29:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:29:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:29:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:29:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:29:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:29:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:29:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:29:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:29:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:29:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:29:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:29:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:29:43,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:43,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132955139] [2024-11-08 18:29:43,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132955139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:29:43,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:29:43,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 18:29:43,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047731735] [2024-11-08 18:29:43,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:29:43,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:29:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:29:43,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:29:43,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:29:43,600 INFO L87 Difference]: Start difference. First operand 497 states and 682 transitions. Second operand has 20 states, 17 states have (on average 3.764705882352941) internal successors, (64), 20 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:29:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:29:49,113 INFO L93 Difference]: Finished difference Result 970 states and 1319 transitions. [2024-11-08 18:29:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:29:49,114 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.764705882352941) internal successors, (64), 20 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) Word has length 161 [2024-11-08 18:29:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:29:49,117 INFO L225 Difference]: With dead ends: 970 [2024-11-08 18:29:49,117 INFO L226 Difference]: Without dead ends: 618 [2024-11-08 18:29:49,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2024-11-08 18:29:49,119 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 318 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:29:49,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 546 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 18:29:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-08 18:29:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 504. [2024-11-08 18:29:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 450 states have (on average 1.3288888888888888) internal successors, (598), 452 states have internal predecessors, (598), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:29:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 690 transitions. [2024-11-08 18:29:49,291 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 690 transitions. Word has length 161 [2024-11-08 18:29:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:29:49,292 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 690 transitions. [2024-11-08 18:29:49,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.764705882352941) internal successors, (64), 20 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:29:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 690 transitions. [2024-11-08 18:29:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 18:29:49,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:29:49,294 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:49,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:29:49,295 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:29:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:29:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash -124849727, now seen corresponding path program 1 times [2024-11-08 18:29:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:29:49,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137543445] [2024-11-08 18:29:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:29:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:29:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:56,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:29:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:29:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:29:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:29:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:29:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:29:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:29:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:29:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:29:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:29:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:29:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:29:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:29:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:29:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:29:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:29:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:29:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:29:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:29:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:29:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:29:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:29:57,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:29:57,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137543445] [2024-11-08 18:29:57,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137543445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:29:57,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:29:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 18:29:57,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263038601] [2024-11-08 18:29:57,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:29:57,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:29:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:29:57,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:29:57,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:29:57,318 INFO L87 Difference]: Start difference. First operand 504 states and 690 transitions. Second operand has 20 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 20 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:01,982 INFO L93 Difference]: Finished difference Result 1083 states and 1468 transitions. [2024-11-08 18:30:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:30:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 20 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-08 18:30:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:01,986 INFO L225 Difference]: With dead ends: 1083 [2024-11-08 18:30:01,986 INFO L226 Difference]: Without dead ends: 724 [2024-11-08 18:30:01,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 18:30:01,989 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 478 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:01,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 900 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 18:30:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-08 18:30:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 514. [2024-11-08 18:30:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 460 states have (on average 1.3282608695652174) internal successors, (611), 462 states have internal predecessors, (611), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:30:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 703 transitions. [2024-11-08 18:30:02,129 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 703 transitions. Word has length 161 [2024-11-08 18:30:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:02,130 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 703 transitions. [2024-11-08 18:30:02,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 20 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 703 transitions. [2024-11-08 18:30:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 18:30:02,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:02,132 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:02,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:30:02,132 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:30:02,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash -544639381, now seen corresponding path program 1 times [2024-11-08 18:30:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:30:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037104725] [2024-11-08 18:30:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:30:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:30:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:30:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:30:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:30:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:30:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:30:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:30:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:30:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:30:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:30:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:30:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:30:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:30:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:30:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:30:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:30:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:30:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:30:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:30:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:30:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:30:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:30:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037104725] [2024-11-08 18:30:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037104725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:30:08,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:30:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:30:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404047022] [2024-11-08 18:30:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:30:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:30:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:30:08,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:30:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:30:08,023 INFO L87 Difference]: Start difference. First operand 514 states and 703 transitions. Second operand has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:10,524 INFO L93 Difference]: Finished difference Result 998 states and 1359 transitions. [2024-11-08 18:30:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:30:10,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-08 18:30:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:10,529 INFO L225 Difference]: With dead ends: 998 [2024-11-08 18:30:10,529 INFO L226 Difference]: Without dead ends: 633 [2024-11-08 18:30:10,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:30:10,531 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 315 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:10,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 443 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 18:30:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-08 18:30:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 534. [2024-11-08 18:30:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 480 states have (on average 1.3229166666666667) internal successors, (635), 482 states have internal predecessors, (635), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:30:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 727 transitions. [2024-11-08 18:30:10,686 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 727 transitions. Word has length 161 [2024-11-08 18:30:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:10,686 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 727 transitions. [2024-11-08 18:30:10,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 727 transitions. [2024-11-08 18:30:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 18:30:10,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:10,689 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:10,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:30:10,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:30:10,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash -62810113, now seen corresponding path program 1 times [2024-11-08 18:30:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:30:10,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065895323] [2024-11-08 18:30:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:30:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:30:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:30:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:30:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:30:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:30:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:30:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:30:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:30:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:30:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:30:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:30:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:30:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:30:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:30:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:30:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:30:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:30:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:30:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:30:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:30:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:30:11,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:30:11,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065895323] [2024-11-08 18:30:11,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065895323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:30:11,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:30:11,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:30:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215678139] [2024-11-08 18:30:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:30:11,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:30:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:30:11,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:30:11,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:30:11,710 INFO L87 Difference]: Start difference. First operand 534 states and 727 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:30:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:13,137 INFO L93 Difference]: Finished difference Result 982 states and 1336 transitions. [2024-11-08 18:30:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:30:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 161 [2024-11-08 18:30:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:13,142 INFO L225 Difference]: With dead ends: 982 [2024-11-08 18:30:13,142 INFO L226 Difference]: Without dead ends: 603 [2024-11-08 18:30:13,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:30:13,144 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 130 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:13,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 488 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 18:30:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-08 18:30:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 502. [2024-11-08 18:30:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 448 states have (on average 1.3214285714285714) internal successors, (592), 450 states have internal predecessors, (592), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:30:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 684 transitions. [2024-11-08 18:30:13,320 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 684 transitions. Word has length 161 [2024-11-08 18:30:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:13,321 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 684 transitions. [2024-11-08 18:30:13,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:30:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 684 transitions. [2024-11-08 18:30:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 18:30:13,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:13,323 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:13,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:30:13,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:30:13,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:13,325 INFO L85 PathProgramCache]: Analyzing trace with hash -411618399, now seen corresponding path program 1 times [2024-11-08 18:30:13,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:30:13,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548917864] [2024-11-08 18:30:13,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:13,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:30:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:30:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:30:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:30:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:30:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:30:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:30:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:30:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:30:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:30:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:30:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:30:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:30:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:30:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:30:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:30:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:30:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:30:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:30:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:30:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:30:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:30:19,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:30:19,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548917864] [2024-11-08 18:30:19,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548917864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:30:19,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:30:19,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:30:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175257462] [2024-11-08 18:30:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:30:19,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:30:19,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:30:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:30:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:30:19,345 INFO L87 Difference]: Start difference. First operand 502 states and 684 transitions. Second operand has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:23,573 INFO L93 Difference]: Finished difference Result 894 states and 1216 transitions. [2024-11-08 18:30:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:30:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-08 18:30:23,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:23,577 INFO L225 Difference]: With dead ends: 894 [2024-11-08 18:30:23,578 INFO L226 Difference]: Without dead ends: 545 [2024-11-08 18:30:23,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:30:23,580 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 230 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:23,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 778 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 18:30:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-08 18:30:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 488. [2024-11-08 18:30:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 434 states have (on average 1.3225806451612903) internal successors, (574), 436 states have internal predecessors, (574), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:30:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 666 transitions. [2024-11-08 18:30:23,750 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 666 transitions. Word has length 161 [2024-11-08 18:30:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:23,751 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 666 transitions. [2024-11-08 18:30:23,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 666 transitions. [2024-11-08 18:30:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 18:30:23,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:23,754 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:23,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:30:23,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:30:23,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash 156960493, now seen corresponding path program 1 times [2024-11-08 18:30:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:30:23,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920596829] [2024-11-08 18:30:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:30:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:30:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:30:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:30:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:30:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:30:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:30:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:30:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:30:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:30:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:30:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:30:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:30:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:30:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:30:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:30:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:30:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:30:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:30:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:30:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:30:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:30:29,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:30:29,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920596829] [2024-11-08 18:30:29,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920596829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:30:29,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:30:29,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 18:30:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218980783] [2024-11-08 18:30:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:30:29,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:30:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:30:29,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:30:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:30:29,330 INFO L87 Difference]: Start difference. First operand 488 states and 666 transitions. Second operand has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:33,535 INFO L93 Difference]: Finished difference Result 930 states and 1257 transitions. [2024-11-08 18:30:33,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:30:33,536 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-08 18:30:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:33,538 INFO L225 Difference]: With dead ends: 930 [2024-11-08 18:30:33,538 INFO L226 Difference]: Without dead ends: 591 [2024-11-08 18:30:33,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2024-11-08 18:30:33,541 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 315 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:33,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 720 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 18:30:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-08 18:30:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 472. [2024-11-08 18:30:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 418 states have (on average 1.3205741626794258) internal successors, (552), 420 states have internal predecessors, (552), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:30:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 644 transitions. [2024-11-08 18:30:33,722 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 644 transitions. Word has length 161 [2024-11-08 18:30:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:33,723 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 644 transitions. [2024-11-08 18:30:33,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 644 transitions. [2024-11-08 18:30:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 18:30:33,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:33,725 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:33,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 18:30:33,726 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:30:33,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash -219491615, now seen corresponding path program 1 times [2024-11-08 18:30:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:30:33,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943527517] [2024-11-08 18:30:33,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:33,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:30:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:30:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:30:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:30:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:30:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:30:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:30:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:30:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:30:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:30:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:30:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:30:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:30:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:30:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:30:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:30:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:30:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:30:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:30:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:30:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:30:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:30:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:30:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943527517] [2024-11-08 18:30:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943527517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:30:40,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:30:40,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:30:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153802354] [2024-11-08 18:30:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:30:40,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:30:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:30:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:30:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:30:40,334 INFO L87 Difference]: Start difference. First operand 472 states and 644 transitions. Second operand has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:44,567 INFO L93 Difference]: Finished difference Result 933 states and 1267 transitions. [2024-11-08 18:30:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:30:44,569 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-08 18:30:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:44,572 INFO L225 Difference]: With dead ends: 933 [2024-11-08 18:30:44,572 INFO L226 Difference]: Without dead ends: 606 [2024-11-08 18:30:44,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:30:44,574 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 290 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:44,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 609 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 18:30:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-08 18:30:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 484. [2024-11-08 18:30:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 430 states have (on average 1.3255813953488371) internal successors, (570), 432 states have internal predecessors, (570), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:30:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 662 transitions. [2024-11-08 18:30:44,765 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 662 transitions. Word has length 161 [2024-11-08 18:30:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:44,766 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 662 transitions. [2024-11-08 18:30:44,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:30:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 662 transitions. [2024-11-08 18:30:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 18:30:44,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:44,768 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:44,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 18:30:44,769 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:30:44,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1240559969, now seen corresponding path program 1 times [2024-11-08 18:30:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:30:44,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824149513] [2024-11-08 18:30:44,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:44,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:30:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:30:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:30:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:30:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:30:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:30:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:30:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:30:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:30:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:30:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:30:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:30:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:30:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:30:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:30:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:30:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:30:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:30:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:30:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:30:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:30:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:30:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:30:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824149513] [2024-11-08 18:30:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824149513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:30:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:30:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 18:30:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173427154] [2024-11-08 18:30:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:30:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:30:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:30:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:30:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:30:51,749 INFO L87 Difference]: Start difference. First operand 484 states and 662 transitions. Second operand has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:30:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:56,598 INFO L93 Difference]: Finished difference Result 924 states and 1253 transitions. [2024-11-08 18:30:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:30:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) Word has length 161 [2024-11-08 18:30:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:56,603 INFO L225 Difference]: With dead ends: 924 [2024-11-08 18:30:56,604 INFO L226 Difference]: Without dead ends: 585 [2024-11-08 18:30:56,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:30:56,606 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 331 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:56,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 789 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 18:30:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-08 18:30:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 468. [2024-11-08 18:30:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 414 states have (on average 1.3236714975845412) internal successors, (548), 416 states have internal predecessors, (548), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:30:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 640 transitions. [2024-11-08 18:30:56,801 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 640 transitions. Word has length 161 [2024-11-08 18:30:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:56,801 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 640 transitions. [2024-11-08 18:30:56,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:30:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 640 transitions. [2024-11-08 18:30:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 18:30:56,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:56,804 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:56,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 18:30:56,804 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:30:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:56,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1640289989, now seen corresponding path program 1 times [2024-11-08 18:30:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:30:56,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616449072] [2024-11-08 18:30:56,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:30:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:30:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:30:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:30:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:30:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:30:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:30:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:30:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:30:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:30:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:30:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:30:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:30:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:30:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:30:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:30:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:30:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:30:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:30:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:30:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:30:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:30:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:30:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:30:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616449072] [2024-11-08 18:30:57,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616449072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:30:57,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:30:57,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:30:57,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926434443] [2024-11-08 18:30:57,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:30:57,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:30:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:30:57,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:30:57,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:30:57,073 INFO L87 Difference]: Start difference. First operand 468 states and 640 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:30:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:30:57,213 INFO L93 Difference]: Finished difference Result 804 states and 1099 transitions. [2024-11-08 18:30:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:30:57,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-08 18:30:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:30:57,216 INFO L225 Difference]: With dead ends: 804 [2024-11-08 18:30:57,216 INFO L226 Difference]: Without dead ends: 477 [2024-11-08 18:30:57,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 18:30:57,217 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:30:57,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:30:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-08 18:30:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-11-08 18:30:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 423 states have (on average 1.3167848699763594) internal successors, (557), 425 states have internal predecessors, (557), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:30:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 649 transitions. [2024-11-08 18:30:57,385 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 649 transitions. Word has length 162 [2024-11-08 18:30:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:30:57,386 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 649 transitions. [2024-11-08 18:30:57,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:30:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 649 transitions. [2024-11-08 18:30:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 18:30:57,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:30:57,389 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:30:57,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 18:30:57,389 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:30:57,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:30:57,390 INFO L85 PathProgramCache]: Analyzing trace with hash -504065886, now seen corresponding path program 1 times [2024-11-08 18:30:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:30:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628930200] [2024-11-08 18:30:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:30:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:30:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:31:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:31:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:31:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:31:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:31:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:31:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:31:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:31:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:31:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:31:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:31:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:31:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:31:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:31:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:31:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:31:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:31:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:31:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:31:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:31:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:31:03,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:31:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628930200] [2024-11-08 18:31:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628930200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:31:03,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:31:03,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 18:31:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757270472] [2024-11-08 18:31:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:31:03,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 18:31:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:31:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 18:31:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-08 18:31:03,300 INFO L87 Difference]: Start difference. First operand 477 states and 649 transitions. Second operand has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:31:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:10,262 INFO L93 Difference]: Finished difference Result 1023 states and 1378 transitions. [2024-11-08 18:31:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 18:31:10,263 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-08 18:31:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:10,266 INFO L225 Difference]: With dead ends: 1023 [2024-11-08 18:31:10,266 INFO L226 Difference]: Without dead ends: 687 [2024-11-08 18:31:10,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 18:31:10,267 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 411 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:10,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1047 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 18:31:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-08 18:31:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 519. [2024-11-08 18:31:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 465 states have (on average 1.3182795698924732) internal successors, (613), 467 states have internal predecessors, (613), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:31:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 705 transitions. [2024-11-08 18:31:10,448 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 705 transitions. Word has length 162 [2024-11-08 18:31:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:10,449 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 705 transitions. [2024-11-08 18:31:10,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:31:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 705 transitions. [2024-11-08 18:31:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 18:31:10,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:10,451 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:31:10,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 18:31:10,452 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:31:10,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1783929564, now seen corresponding path program 1 times [2024-11-08 18:31:10,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:31:10,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606946408] [2024-11-08 18:31:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:31:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:31:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:31:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:31:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:31:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:31:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:31:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:31:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:31:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:31:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:31:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:31:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:31:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:31:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:31:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:31:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:31:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:31:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:31:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:31:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:31:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:31:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:31:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606946408] [2024-11-08 18:31:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606946408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:31:11,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:31:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:31:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138903100] [2024-11-08 18:31:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:31:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:31:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:31:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:31:11,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:31:11,241 INFO L87 Difference]: Start difference. First operand 519 states and 705 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:31:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:12,499 INFO L93 Difference]: Finished difference Result 885 states and 1200 transitions. [2024-11-08 18:31:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:31:12,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-08 18:31:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:12,502 INFO L225 Difference]: With dead ends: 885 [2024-11-08 18:31:12,502 INFO L226 Difference]: Without dead ends: 523 [2024-11-08 18:31:12,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:31:12,504 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 84 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:12,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 355 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 18:31:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-08 18:31:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2024-11-08 18:31:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 465 states have (on average 1.3010752688172043) internal successors, (605), 467 states have internal predecessors, (605), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:31:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 697 transitions. [2024-11-08 18:31:12,706 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 697 transitions. Word has length 162 [2024-11-08 18:31:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 697 transitions. [2024-11-08 18:31:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:31:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 697 transitions. [2024-11-08 18:31:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 18:31:12,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:12,710 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:31:12,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 18:31:12,710 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:31:12,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1985463076, now seen corresponding path program 1 times [2024-11-08 18:31:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:31:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000189306] [2024-11-08 18:31:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:31:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:31:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:31:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:31:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:31:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:31:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:31:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:31:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:31:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:31:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:31:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:31:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:31:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:31:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:31:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:31:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:31:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:31:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:31:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:31:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:31:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:31:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:31:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000189306] [2024-11-08 18:31:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000189306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:31:18,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:31:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 18:31:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556167198] [2024-11-08 18:31:18,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:31:18,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 18:31:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:31:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 18:31:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2024-11-08 18:31:18,851 INFO L87 Difference]: Start difference. First operand 519 states and 697 transitions. Second operand has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 20 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:31:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:24,238 INFO L93 Difference]: Finished difference Result 957 states and 1277 transitions. [2024-11-08 18:31:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:31:24,239 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 20 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-08 18:31:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:24,241 INFO L225 Difference]: With dead ends: 957 [2024-11-08 18:31:24,241 INFO L226 Difference]: Without dead ends: 595 [2024-11-08 18:31:24,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2024-11-08 18:31:24,242 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 200 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:24,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1024 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 18:31:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-08 18:31:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 523. [2024-11-08 18:31:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 469 states have (on average 1.3070362473347548) internal successors, (613), 471 states have internal predecessors, (613), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:31:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 705 transitions. [2024-11-08 18:31:24,365 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 705 transitions. Word has length 162 [2024-11-08 18:31:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:24,365 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 705 transitions. [2024-11-08 18:31:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 20 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:31:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 705 transitions. [2024-11-08 18:31:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 18:31:24,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:24,367 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:31:24,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 18:31:24,367 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:31:24,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash 882137508, now seen corresponding path program 1 times [2024-11-08 18:31:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:31:24,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959558540] [2024-11-08 18:31:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:31:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:31:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:31:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:31:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:31:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:31:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:31:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:31:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:31:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:31:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:31:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:31:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:31:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:31:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:31:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:31:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:31:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:31:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:31:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:31:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:31:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:31:24,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:31:24,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959558540] [2024-11-08 18:31:24,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959558540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:31:24,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:31:24,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:31:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475711878] [2024-11-08 18:31:24,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:31:24,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:31:24,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:31:24,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:31:24,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:31:24,790 INFO L87 Difference]: Start difference. First operand 523 states and 705 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:31:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:25,301 INFO L93 Difference]: Finished difference Result 877 states and 1175 transitions. [2024-11-08 18:31:25,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:31:25,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-08 18:31:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:25,304 INFO L225 Difference]: With dead ends: 877 [2024-11-08 18:31:25,304 INFO L226 Difference]: Without dead ends: 495 [2024-11-08 18:31:25,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 18:31:25,305 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:25,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:31:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-08 18:31:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2024-11-08 18:31:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 441 states have (on average 1.290249433106576) internal successors, (569), 443 states have internal predecessors, (569), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:31:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 661 transitions. [2024-11-08 18:31:25,423 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 661 transitions. Word has length 162 [2024-11-08 18:31:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:25,423 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 661 transitions. [2024-11-08 18:31:25,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:31:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 661 transitions. [2024-11-08 18:31:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 18:31:25,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:25,426 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:31:25,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 18:31:25,426 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:31:25,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:25,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1156897122, now seen corresponding path program 1 times [2024-11-08 18:31:25,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:31:25,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095256970] [2024-11-08 18:31:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:31:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:31:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:31:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:31:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:31:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:31:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:31:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:31:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:31:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:31:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:31:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:31:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:31:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:31:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:31:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:31:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:31:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:31:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:31:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:31:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:31:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:31:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:31:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095256970] [2024-11-08 18:31:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095256970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:31:29,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:31:29,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:31:29,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287724754] [2024-11-08 18:31:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:31:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:31:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:31:29,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:31:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:31:29,654 INFO L87 Difference]: Start difference. First operand 495 states and 661 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:31:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:32,194 INFO L93 Difference]: Finished difference Result 927 states and 1226 transitions. [2024-11-08 18:31:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:31:32,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-08 18:31:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:32,198 INFO L225 Difference]: With dead ends: 927 [2024-11-08 18:31:32,198 INFO L226 Difference]: Without dead ends: 577 [2024-11-08 18:31:32,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:31:32,199 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 167 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:32,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 532 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 18:31:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-08 18:31:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 515. [2024-11-08 18:31:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 461 states have (on average 1.2863340563991323) internal successors, (593), 463 states have internal predecessors, (593), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:31:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 685 transitions. [2024-11-08 18:31:32,299 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 685 transitions. Word has length 162 [2024-11-08 18:31:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:32,300 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 685 transitions. [2024-11-08 18:31:32,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:31:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 685 transitions. [2024-11-08 18:31:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 18:31:32,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:32,302 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:31:32,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 18:31:32,302 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:31:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2117111262, now seen corresponding path program 1 times [2024-11-08 18:31:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:31:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247438628] [2024-11-08 18:31:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:31:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:31:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:31:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:31:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:31:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:31:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:31:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:31:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:31:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:31:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:31:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:31:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:31:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:31:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:31:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:31:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:31:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:31:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:31:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:31:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:31:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:31:42,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:31:42,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247438628] [2024-11-08 18:31:42,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247438628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:31:42,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:31:42,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-11-08 18:31:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12770826] [2024-11-08 18:31:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:31:42,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 18:31:42,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:31:42,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 18:31:42,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2024-11-08 18:31:42,451 INFO L87 Difference]: Start difference. First operand 515 states and 685 transitions. Second operand has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 27 states have internal predecessors, (65), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:31:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:31:52,788 INFO L93 Difference]: Finished difference Result 1045 states and 1375 transitions. [2024-11-08 18:31:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 18:31:52,790 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 27 states have internal predecessors, (65), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) Word has length 162 [2024-11-08 18:31:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:31:52,796 INFO L225 Difference]: With dead ends: 1045 [2024-11-08 18:31:52,796 INFO L226 Difference]: Without dead ends: 683 [2024-11-08 18:31:52,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 18:31:52,798 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 285 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:31:52,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1991 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-08 18:31:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-08 18:31:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 541. [2024-11-08 18:31:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 487 states have (on average 1.2833675564681726) internal successors, (625), 489 states have internal predecessors, (625), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:31:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 717 transitions. [2024-11-08 18:31:52,927 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 717 transitions. Word has length 162 [2024-11-08 18:31:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:31:52,927 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 717 transitions. [2024-11-08 18:31:52,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 27 states have internal predecessors, (65), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 18:31:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 717 transitions. [2024-11-08 18:31:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 18:31:52,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:31:52,929 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:31:52,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 18:31:52,929 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:31:52,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:31:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash 372417700, now seen corresponding path program 1 times [2024-11-08 18:31:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:31:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843925491] [2024-11-08 18:31:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:31:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:31:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:31:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:31:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:31:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:31:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:31:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:31:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:31:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:31:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:31:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:31:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:31:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:31:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:31:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:31:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:31:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:31:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:31:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:31:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:31:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:31:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:31:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:31:59,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:31:59,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843925491] [2024-11-08 18:31:59,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843925491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:31:59,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:31:59,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 18:31:59,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449818105] [2024-11-08 18:31:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:31:59,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 18:31:59,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:31:59,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 18:31:59,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-08 18:31:59,163 INFO L87 Difference]: Start difference. First operand 541 states and 717 transitions. Second operand has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:32:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:32:03,773 INFO L93 Difference]: Finished difference Result 975 states and 1285 transitions. [2024-11-08 18:32:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:32:03,774 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-08 18:32:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:32:03,777 INFO L225 Difference]: With dead ends: 975 [2024-11-08 18:32:03,777 INFO L226 Difference]: Without dead ends: 595 [2024-11-08 18:32:03,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 18:32:03,779 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 344 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:32:03,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 970 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 18:32:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-08 18:32:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 523. [2024-11-08 18:32:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 469 states have (on average 1.2814498933901919) internal successors, (601), 471 states have internal predecessors, (601), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:32:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 693 transitions. [2024-11-08 18:32:03,916 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 693 transitions. Word has length 162 [2024-11-08 18:32:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:32:03,917 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 693 transitions. [2024-11-08 18:32:03,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:32:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 693 transitions. [2024-11-08 18:32:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 18:32:03,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:32:03,919 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:32:03,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 18:32:03,919 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:32:03,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:32:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1029132902, now seen corresponding path program 1 times [2024-11-08 18:32:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:32:03,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003783371] [2024-11-08 18:32:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:32:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:32:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:32:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:32:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:32:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:32:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:32:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:32:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:32:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:32:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:32:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:32:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:32:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:32:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:32:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:32:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:32:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:12,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:32:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:12,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:32:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:32:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:32:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:12,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:32:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:32:12,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:32:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003783371] [2024-11-08 18:32:12,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003783371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:32:12,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:32:12,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-08 18:32:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598964689] [2024-11-08 18:32:12,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:32:12,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:32:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:32:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:32:12,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:32:12,114 INFO L87 Difference]: Start difference. First operand 523 states and 693 transitions. Second operand has 22 states, 20 states have (on average 3.3) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:32:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:32:18,648 INFO L93 Difference]: Finished difference Result 937 states and 1237 transitions. [2024-11-08 18:32:18,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:32:18,649 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.3) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 163 [2024-11-08 18:32:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:32:18,651 INFO L225 Difference]: With dead ends: 937 [2024-11-08 18:32:18,652 INFO L226 Difference]: Without dead ends: 567 [2024-11-08 18:32:18,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 18:32:18,654 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 310 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:32:18,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1027 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 18:32:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-08 18:32:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 503. [2024-11-08 18:32:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 449 states have (on average 1.289532293986637) internal successors, (579), 451 states have internal predecessors, (579), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:32:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 671 transitions. [2024-11-08 18:32:18,782 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 671 transitions. Word has length 163 [2024-11-08 18:32:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:32:18,783 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 671 transitions. [2024-11-08 18:32:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.3) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:32:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 671 transitions. [2024-11-08 18:32:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 18:32:18,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:32:18,784 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:32:18,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 18:32:18,785 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:32:18,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:32:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 979378598, now seen corresponding path program 1 times [2024-11-08 18:32:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:32:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297011593] [2024-11-08 18:32:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:32:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:32:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:32:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:32:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:32:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:32:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:32:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:32:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:32:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:32:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:32:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:32:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:32:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:32:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:32:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:32:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:32:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:32:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:32:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:32:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:32:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:32:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:32:24,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:32:24,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297011593] [2024-11-08 18:32:24,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297011593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:32:24,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:32:24,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 18:32:24,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8475416] [2024-11-08 18:32:24,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:32:24,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 18:32:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:32:24,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 18:32:24,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:32:24,617 INFO L87 Difference]: Start difference. First operand 503 states and 671 transitions. Second operand has 15 states, 13 states have (on average 5.076923076923077) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:32:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:32:27,403 INFO L93 Difference]: Finished difference Result 853 states and 1137 transitions. [2024-11-08 18:32:27,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:32:27,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.076923076923077) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 163 [2024-11-08 18:32:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:32:27,406 INFO L225 Difference]: With dead ends: 853 [2024-11-08 18:32:27,406 INFO L226 Difference]: Without dead ends: 499 [2024-11-08 18:32:27,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:32:27,408 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 356 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:32:27,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 519 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 18:32:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-08 18:32:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 487. [2024-11-08 18:32:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 433 states have (on average 1.2863741339491916) internal successors, (557), 435 states have internal predecessors, (557), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:32:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 649 transitions. [2024-11-08 18:32:27,513 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 649 transitions. Word has length 163 [2024-11-08 18:32:27,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:32:27,513 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 649 transitions. [2024-11-08 18:32:27,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.076923076923077) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:32:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 649 transitions. [2024-11-08 18:32:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 18:32:27,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:32:27,514 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:32:27,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 18:32:27,515 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:32:27,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:32:27,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2000337510, now seen corresponding path program 1 times [2024-11-08 18:32:27,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:32:27,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069864477] [2024-11-08 18:32:27,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:32:27,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:32:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:32:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:32:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:32:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:32:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:32:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:32:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:32:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:32:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:32:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:32:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:32:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:32:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:32:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:32:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:32:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:32:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:32:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:32:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:32:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:32:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:32:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:32:36,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:32:36,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069864477] [2024-11-08 18:32:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069864477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:32:36,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:32:36,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-08 18:32:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101612311] [2024-11-08 18:32:36,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:32:36,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 18:32:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:32:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 18:32:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-11-08 18:32:36,783 INFO L87 Difference]: Start difference. First operand 487 states and 649 transitions. Second operand has 24 states, 22 states have (on average 3.0) internal successors, (66), 24 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:32:53,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 18:32:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:32:54,234 INFO L93 Difference]: Finished difference Result 1055 states and 1380 transitions. [2024-11-08 18:32:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 18:32:54,235 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.0) internal successors, (66), 24 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 163 [2024-11-08 18:32:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:32:54,239 INFO L225 Difference]: With dead ends: 1055 [2024-11-08 18:32:54,239 INFO L226 Difference]: Without dead ends: 713 [2024-11-08 18:32:54,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 18:32:54,241 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 317 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-11-08 18:32:54,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 2001 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2989 Invalid, 1 Unknown, 0 Unchecked, 10.7s Time] [2024-11-08 18:32:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-11-08 18:32:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 499. [2024-11-08 18:32:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 445 states have (on average 1.296629213483146) internal successors, (577), 447 states have internal predecessors, (577), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:32:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 669 transitions. [2024-11-08 18:32:54,411 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 669 transitions. Word has length 163 [2024-11-08 18:32:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:32:54,412 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 669 transitions. [2024-11-08 18:32:54,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.0) internal successors, (66), 24 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:32:54,412 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 669 transitions. [2024-11-08 18:32:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 18:32:54,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:32:54,414 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:32:54,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 18:32:54,414 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:32:54,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:32:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1866324004, now seen corresponding path program 1 times [2024-11-08 18:32:54,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:32:54,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267965842] [2024-11-08 18:32:54,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:32:54,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:32:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:33:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:33:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:33:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:33:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:33:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:33:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:33:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267965842] [2024-11-08 18:33:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267965842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-08 18:33:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164773808] [2024-11-08 18:33:02,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:02,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 18:33:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:02,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 18:33:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-11-08 18:33:02,393 INFO L87 Difference]: Start difference. First operand 499 states and 669 transitions. Second operand has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:33:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:09,121 INFO L93 Difference]: Finished difference Result 891 states and 1187 transitions. [2024-11-08 18:33:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:33:09,122 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 163 [2024-11-08 18:33:09,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:09,126 INFO L225 Difference]: With dead ends: 891 [2024-11-08 18:33:09,126 INFO L226 Difference]: Without dead ends: 543 [2024-11-08 18:33:09,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 18:33:09,129 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 196 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:09,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 939 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 18:33:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-08 18:33:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 467. [2024-11-08 18:33:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 413 states have (on average 1.2953995157384988) internal successors, (535), 415 states have internal predecessors, (535), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:33:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 627 transitions. [2024-11-08 18:33:09,271 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 627 transitions. Word has length 163 [2024-11-08 18:33:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:09,272 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 627 transitions. [2024-11-08 18:33:09,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-08 18:33:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 627 transitions. [2024-11-08 18:33:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 18:33:09,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:09,274 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:33:09,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 18:33:09,275 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:09,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:09,275 INFO L85 PathProgramCache]: Analyzing trace with hash 69910442, now seen corresponding path program 1 times [2024-11-08 18:33:09,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:09,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886252448] [2024-11-08 18:33:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 18:33:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:33:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:33:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 18:33:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 18:33:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 18:33:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 18:33:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 18:33:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 18:33:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:33:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 18:33:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:33:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 18:33:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:33:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 18:33:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 18:33:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 18:33:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 18:33:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 18:33:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 18:33:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:33:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:33:09,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886252448] [2024-11-08 18:33:09,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886252448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:09,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:09,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:33:09,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156919919] [2024-11-08 18:33:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:09,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:33:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:33:09,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:33:09,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:33:09,810 INFO L87 Difference]: Start difference. First operand 467 states and 627 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:33:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:10,381 INFO L93 Difference]: Finished difference Result 980 states and 1291 transitions. [2024-11-08 18:33:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:33:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2024-11-08 18:33:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:10,384 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:33:10,385 INFO L226 Difference]: Without dead ends: 654 [2024-11-08 18:33:10,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:33:10,386 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 30 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:10,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 402 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:33:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-08 18:33:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 601. [2024-11-08 18:33:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 547 states have (on average 1.2742230347349177) internal successors, (697), 549 states have internal predecessors, (697), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 18:33:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 789 transitions. [2024-11-08 18:33:10,507 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 789 transitions. Word has length 164 [2024-11-08 18:33:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:10,507 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 789 transitions. [2024-11-08 18:33:10,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:33:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 789 transitions. [2024-11-08 18:33:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 18:33:10,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:10,509 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:33:10,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 18:33:10,509 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:10,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1508368450, now seen corresponding path program 1 times [2024-11-08 18:33:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:33:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900928990] [2024-11-08 18:33:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:33:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:33:10,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:33:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:33:11,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:33:11,279 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:33:11,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:33:11,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 18:33:11,285 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:33:11,490 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:33:11,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:33:11 BoogieIcfgContainer [2024-11-08 18:33:11,496 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:33:11,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:33:11,497 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:33:11,498 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:33:11,498 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:27:33" (3/4) ... [2024-11-08 18:33:11,501 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:33:11,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:33:11,503 INFO L158 Benchmark]: Toolchain (without parser) took 340178.25ms. Allocated memory was 132.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 94.5MB in the beginning and 970.8MB in the end (delta: -876.3MB). Peak memory consumption was 187.0MB. Max. memory is 16.1GB. [2024-11-08 18:33:11,504 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:33:11,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.59ms. Allocated memory is still 132.1MB. Free memory was 94.1MB in the beginning and 76.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:33:11,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.95ms. Allocated memory is still 132.1MB. Free memory was 76.2MB in the beginning and 71.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:33:11,507 INFO L158 Benchmark]: Boogie Preprocessor took 65.75ms. Allocated memory is still 132.1MB. Free memory was 71.7MB in the beginning and 68.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:33:11,507 INFO L158 Benchmark]: RCFGBuilder took 1157.11ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 68.2MB in the beginning and 105.7MB in the end (delta: -37.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-08 18:33:11,508 INFO L158 Benchmark]: TraceAbstraction took 338408.38ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 104.6MB in the beginning and 970.8MB in the end (delta: -866.1MB). Peak memory consumption was 692.0MB. Max. memory is 16.1GB. [2024-11-08 18:33:11,508 INFO L158 Benchmark]: Witness Printer took 5.69ms. Allocated memory is still 1.2GB. Free memory is still 970.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:33:11,509 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.30ms. Allocated memory is still 132.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.59ms. Allocated memory is still 132.1MB. Free memory was 94.1MB in the beginning and 76.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.95ms. Allocated memory is still 132.1MB. Free memory was 76.2MB in the beginning and 71.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.75ms. Allocated memory is still 132.1MB. Free memory was 71.7MB in the beginning and 68.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1157.11ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 68.2MB in the beginning and 105.7MB in the end (delta: -37.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * TraceAbstraction took 338408.38ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 104.6MB in the beginning and 970.8MB in the end (delta: -866.1MB). Peak memory consumption was 692.0MB. Max. memory is 16.1GB. * Witness Printer took 5.69ms. Allocated memory is still 1.2GB. Free memory is still 970.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L57] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L61] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L62] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L63] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L64] unsigned short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L65] signed short int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L66] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L67] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L68] signed short int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L69] signed short int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L70] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L71] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L72] unsigned short int last_1_WrapperStruct00_var_1_8 = 64; [L73] signed short int last_1_WrapperStruct00_var_1_11 = -4; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=0, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L131] EXPR WrapperStruct00.var_1_8 [L131] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L132] EXPR WrapperStruct00.var_1_11 [L132] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L142] RET updateLastVariables() [L143] CALL updateVariables() [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L102] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L114] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L116] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L117] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L119] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L122] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L123] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L124] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L126] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L127] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L128] EXPR WrapperStruct00.var_1_18 [L128] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L128] EXPR WrapperStruct00.var_1_18 [L128] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L143] RET updateVariables() [L144] CALL step() [L77] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L78] COND TRUE stepLocal_0 != last_1_WrapperStruct00_var_1_8 [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L79] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L79] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L79] EXPR (((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L79] EXPR (((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L79] (*(WrapperStruct00_var_1_1_Pointer)) = ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) [L83] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L83] COND TRUE (*(WrapperStruct00_var_1_9_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L84] (*(WrapperStruct00_var_1_8_Pointer)) = (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))) [L86] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] COND TRUE ! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) [L87] (*(WrapperStruct00_var_1_16_Pointer)) = (32 - 8) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L91] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] COND FALSE !((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer)))) [L135] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L135] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L135] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L135] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L135] EXPR (((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1) [L135] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1 [L135] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L135] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1) [L135] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer)))))) [L135] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) [L135] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L135] EXPR (! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) [L135] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L135] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135-L136] return (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 338.1s, OverallIterations: 37, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 139.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 8446 SdHoareTripleChecker+Valid, 92.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8389 mSDsluCounter, 25312 SdHoareTripleChecker+Invalid, 86.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21327 mSDsCounter, 945 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38160 IncrementalHoareTripleChecker+Invalid, 39106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 945 mSolverCounterUnsat, 3985 mSDtfsCounter, 38160 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2538 GetRequests, 1789 SyntacticMatches, 30 SemanticMatches, 719 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3934 ImplicationChecksByTransitivity, 69.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=601occurred in iteration=36, InterpolantAutomatonStates: 437, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 2414 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 184.9s InterpolantComputationTime, 5949 NumberOfCodeBlocks, 5949 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 5749 ConstructedInterpolants, 0 QuantifiedInterpolants, 129677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 27360/27360 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 18:33:11,734 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-08 18:33:11,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:33:14,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:33:14,615 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:33:14,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:33:14,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:33:14,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:33:14,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:33:14,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:33:14,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:33:14,680 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:33:14,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:33:14,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:33:14,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:33:14,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:33:14,683 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:33:14,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:33:14,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:33:14,685 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:33:14,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:33:14,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:33:14,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:33:14,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:33:14,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:33:14,691 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:33:14,691 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:33:14,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:33:14,692 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:33:14,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:33:14,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:33:14,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:33:14,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:33:14,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:33:14,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:33:14,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:33:14,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:33:14,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:33:14,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:33:14,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:33:14,699 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:33:14,699 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:33:14,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:33:14,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:33:14,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:33:14,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:33:14,702 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_a1d5211a-3794-4a62-8b6a-76d1d343693e/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_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 -> 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a [2024-11-08 18:33:15,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:33:15,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:33:15,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:33:15,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:33:15,270 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:33:15,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i Unable to find full path for "g++" [2024-11-08 18:33:17,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:33:18,014 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:33:18,015 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-08 18:33:18,025 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/data/865426f55/40854243be3c4d74bff69be9780ff369/FLAGf050e22ba [2024-11-08 18:33:18,204 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/data/865426f55/40854243be3c4d74bff69be9780ff369 [2024-11-08 18:33:18,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:33:18,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:33:18,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:33:18,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:33:18,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:33:18,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:18,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c33d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18, skipping insertion in model container [2024-11-08 18:33:18,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:18,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:33:18,498 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_a1d5211a-3794-4a62-8b6a-76d1d343693e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-11-08 18:33:18,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:33:18,627 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:33:18,643 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_a1d5211a-3794-4a62-8b6a-76d1d343693e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-11-08 18:33:18,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:33:18,744 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:33:18,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18 WrapperNode [2024-11-08 18:33:18,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:33:18,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:33:18,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:33:18,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:33:18,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:18,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:18,919 INFO L138 Inliner]: procedures = 34, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 436 [2024-11-08 18:33:18,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:33:18,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:33:18,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:33:18,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:33:18,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:18,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:18,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:19,013 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-11-08 18:33:19,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:19,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:19,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:19,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:19,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:19,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:19,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:33:19,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:33:19,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:33:19,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:33:19,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (1/1) ... [2024-11-08 18:33:19,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:33:19,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:33:19,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:33:19,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:33:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:33:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 18:33:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 18:33:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:33:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 18:33:19,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 18:33:19,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 18:33:19,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 18:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 18:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 18:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 18:33:19,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 18:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 18:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 18:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 18:33:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:33:19,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:33:19,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 18:33:19,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 18:33:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:33:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:33:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 18:33:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 18:33:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 18:33:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 18:33:19,405 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:33:19,407 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:33:20,774 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-08 18:33:20,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:33:20,792 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:33:20,793 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:33:20,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:33:20 BoogieIcfgContainer [2024-11-08 18:33:20,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:33:20,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:33:20,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:33:20,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:33:20,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:33:18" (1/3) ... [2024-11-08 18:33:20,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc30598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:33:20, skipping insertion in model container [2024-11-08 18:33:20,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:33:18" (2/3) ... [2024-11-08 18:33:20,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc30598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:33:20, skipping insertion in model container [2024-11-08 18:33:20,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:33:20" (3/3) ... [2024-11-08 18:33:20,806 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-08 18:33:20,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:33:20,826 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:33:20,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:33:20,927 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;@7e4f7ee6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:33:20,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:33:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 18:33:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 18:33:20,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:20,955 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:33:20,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:20,963 INFO L85 PathProgramCache]: Analyzing trace with hash 978504894, now seen corresponding path program 1 times [2024-11-08 18:33:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:33:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355950704] [2024-11-08 18:33:20,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:20,981 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 18:33:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:33:20,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:20,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:21,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:33:21,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 18:33:21,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:33:21,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:33:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355950704] [2024-11-08 18:33:21,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355950704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:21,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:21,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:33:21,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151627340] [2024-11-08 18:33:21,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:33:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:33:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:33:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:33:21,626 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 18:33:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:21,667 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-08 18:33:21,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:33:21,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-08 18:33:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:21,679 INFO L225 Difference]: With dead ends: 199 [2024-11-08 18:33:21,679 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 18:33:21,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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 18:33:21,687 INFO L432 NwaCegarLoop]: 141 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, 141 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 18:33:21,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:33:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 18:33:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 18:33:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 18:33:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-08 18:33:21,746 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2024-11-08 18:33:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:21,747 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-08 18:33:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 18:33:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-08 18:33:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 18:33:21,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:21,758 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:33:21,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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)] Ended with exit code 0 [2024-11-08 18:33:21,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:21,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1086411042, now seen corresponding path program 1 times [2024-11-08 18:33:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:33:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772860926] [2024-11-08 18:33:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:21,962 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 18:33:21,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:33:21,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:21,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:22,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:33:22,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 18:33:22,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:33:22,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:33:22,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772860926] [2024-11-08 18:33:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772860926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:22,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:22,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:33:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260732769] [2024-11-08 18:33:22,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:33:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:33:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:33:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:33:22,491 INFO L87 Difference]: Start difference. First operand 99 states and 141 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 18:33:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:22,591 INFO L93 Difference]: Finished difference Result 197 states and 282 transitions. [2024-11-08 18:33:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:33:22,595 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-08 18:33:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:22,598 INFO L225 Difference]: With dead ends: 197 [2024-11-08 18:33:22,598 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 18:33:22,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 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 18:33:22,604 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 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 18:33:22,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:33:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 18:33:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-08 18:33:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 18:33:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-08 18:33:22,637 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2024-11-08 18:33:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:22,638 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-08 18:33:22,639 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 18:33:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-08 18:33:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 18:33:22,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:22,645 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:33:22,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:22,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:22,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:22,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash 384811168, now seen corresponding path program 1 times [2024-11-08 18:33:22,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:33:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109647451] [2024-11-08 18:33:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:22,852 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 18:33:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:33:22,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:22,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:23,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 18:33:23,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:33:23,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:33:23,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:33:23,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109647451] [2024-11-08 18:33:23,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109647451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:23,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:23,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:33:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648284424] [2024-11-08 18:33:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:23,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:33:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:33:23,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:33:23,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:33:23,481 INFO L87 Difference]: Start difference. First operand 101 states and 143 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:33:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:23,591 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2024-11-08 18:33:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:33:23,592 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-08 18:33:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:23,595 INFO L225 Difference]: With dead ends: 206 [2024-11-08 18:33:23,595 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 18:33:23,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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 18:33:23,597 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:23,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:33:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 18:33:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-08 18:33:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 85 states have internal predecessors, (109), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 18:33:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-08 18:33:23,611 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 150 [2024-11-08 18:33:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:23,612 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-08 18:33:23,612 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:33:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-08 18:33:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 18:33:23,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:23,615 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:33:23,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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)] Forceful destruction successful, exit code 0 [2024-11-08 18:33:23,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:23,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:23,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash 386658210, now seen corresponding path program 1 times [2024-11-08 18:33:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:33:23,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043640608] [2024-11-08 18:33:23,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:23,818 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 18:33:23,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:33:23,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:23,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:24,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 18:33:24,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:24,255 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 92 treesize of output 91 [2024-11-08 18:33:24,525 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 120 treesize of output 110 [2024-11-08 18:33:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 18:33:25,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:33:25,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:33:25,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043640608] [2024-11-08 18:33:25,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043640608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:33:25,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:33:25,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:33:25,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494905568] [2024-11-08 18:33:25,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:33:25,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:33:25,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:33:25,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:33:25,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:33:25,086 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:33:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:33:27,101 INFO L93 Difference]: Finished difference Result 316 states and 442 transitions. [2024-11-08 18:33:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:33:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-08 18:33:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:33:27,105 INFO L225 Difference]: With dead ends: 316 [2024-11-08 18:33:27,105 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 18:33:27,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:33:27,112 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 71 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:33:27,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 481 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 18:33:27,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 18:33:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2024-11-08 18:33:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 134 states have internal predecessors, (168), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 18:33:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 248 transitions. [2024-11-08 18:33:27,140 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 248 transitions. Word has length 150 [2024-11-08 18:33:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:33:27,141 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 248 transitions. [2024-11-08 18:33:27,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 18:33:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 248 transitions. [2024-11-08 18:33:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 18:33:27,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:33:27,144 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:33:27,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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)] Ended with exit code 0 [2024-11-08 18:33:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:27,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:33:27,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:33:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1745694528, now seen corresponding path program 1 times [2024-11-08 18:33:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:33:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45506805] [2024-11-08 18:33:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:33:27,347 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 18:33:27,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:33:27,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:27,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:33:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:33:27,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-08 18:33:27,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:33:28,489 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 18:33:30,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-08 18:33:31,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 18:33:32,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-08 18:33:33,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-08 18:33:34,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-08 18:33:35,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-08 18:33:37,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-08 18:33:39,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-08 18:33:40,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-08 18:33:41,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 67 [2024-11-08 18:33:42,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2024-11-08 18:33:42,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2024-11-08 18:33:42,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2024-11-08 18:33:43,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:33:43,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 42 [2024-11-08 18:33:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 504 proven. 76 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 18:33:43,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:34:15,846 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:34:15,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45506805] [2024-11-08 18:34:15,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45506805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:34:15,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820143197] [2024-11-08 18:34:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:34:15,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:34:15,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:34:15,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:34:15,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 18:34:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:34:16,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-08 18:34:16,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:34:16,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:34:19,552 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 22 treesize of output 21 [2024-11-08 18:34:21,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-08 18:34:23,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-08 18:34:26,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 18:34:28,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2024-11-08 18:34:30,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 55 [2024-11-08 18:34:32,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2024-11-08 18:34:36,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 77 [2024-11-08 18:34:39,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2024-11-08 18:34:42,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 95 [2024-11-08 18:34:43,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 98 [2024-11-08 18:34:44,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 98 [2024-11-08 18:34:45,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 98 [2024-11-08 18:34:46,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:34:46,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 107 treesize of output 55 [2024-11-08 18:34:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 462 proven. 205 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 18:34:47,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:35:07,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820143197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:35:07,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:35:07,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 39 [2024-11-08 18:35:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123010973] [2024-11-08 18:35:07,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:35:07,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-08 18:35:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:35:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 18:35:07,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2213, Unknown=5, NotChecked=0, Total=2450 [2024-11-08 18:35:07,491 INFO L87 Difference]: Start difference. First operand 177 states and 248 transitions. Second operand has 40 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 37 states have internal predecessors, (139), 14 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2024-11-08 18:35:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:35:46,814 INFO L93 Difference]: Finished difference Result 474 states and 623 transitions. [2024-11-08 18:35:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-08 18:35:46,815 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 37 states have internal predecessors, (139), 14 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) Word has length 158 [2024-11-08 18:35:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:35:46,818 INFO L225 Difference]: With dead ends: 474 [2024-11-08 18:35:46,818 INFO L226 Difference]: Without dead ends: 370 [2024-11-08 18:35:46,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 327 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2883 ImplicationChecksByTransitivity, 79.5s TimeCoverageRelationStatistics Valid=1222, Invalid=8279, Unknown=5, NotChecked=0, Total=9506 [2024-11-08 18:35:46,823 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 901 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:35:46,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1298 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 21.2s Time] [2024-11-08 18:35:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-08 18:35:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 312. [2024-11-08 18:35:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 244 states have (on average 1.2377049180327868) internal successors, (302), 245 states have internal predecessors, (302), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 18:35:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 410 transitions. [2024-11-08 18:35:46,914 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 410 transitions. Word has length 158 [2024-11-08 18:35:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:35:46,915 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 410 transitions. [2024-11-08 18:35:46,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 37 states have internal predecessors, (139), 14 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2024-11-08 18:35:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 410 transitions. [2024-11-08 18:35:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 18:35:46,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:35:46,918 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:35:46,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:35:47,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:35:47,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:35:47,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:35:47,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:35:47,324 INFO L85 PathProgramCache]: Analyzing trace with hash 566010278, now seen corresponding path program 1 times [2024-11-08 18:35:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:35:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127765384] [2024-11-08 18:35:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:35:47,325 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 18:35:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:35:47,326 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:35:47,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d5211a-3794-4a62-8b6a-76d1d343693e/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 18:35:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:35:47,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-08 18:35:47,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:35:48,652 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 18:35:51,131 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 30 treesize of output 25 [2024-11-08 18:35:53,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-08 18:35:55,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-08 18:35:59,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2024-11-08 18:36:01,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2024-11-08 18:36:05,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 69 [2024-11-08 18:36:08,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2024-11-08 18:36:12,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2024-11-08 18:36:15,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2024-11-08 18:36:19,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 93 [2024-11-08 18:36:20,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 97 [2024-11-08 18:36:21,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 106 [2024-11-08 18:36:22,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 109 [2024-11-08 18:36:23,983 INFO L349 Elim1Store]: treesize reduction 276, result has 13.5 percent of original size [2024-11-08 18:36:23,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 134 treesize of output 179 [2024-11-08 18:36:41,238 WARN L286 SmtUtils]: Spent 11.76s on a formula simplification that was a NOOP. DAG size: 643 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-08 18:36:41,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:36:41,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 45 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 354 treesize of output 1746