./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.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_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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_5dc12be2-2c35-486c-9dd1-962801af3c3e/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 f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:24:54,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:24:55,003 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:24:55,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:24:55,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:24:55,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:24:55,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:24:55,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:24:55,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:24:55,054 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:24:55,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:24:55,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:24:55,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:24:55,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:24:55,058 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:24:55,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:24:55,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:24:55,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:24:55,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:24:55,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:24:55,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:24:55,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:24:55,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:24:55,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:24:55,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:24:55,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:24:55,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:24:55,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:24:55,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:24:55,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:24:55,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:24:55,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:24:55,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:24:55,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:24:55,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:24:55,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:24:55,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:24:55,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:24:55,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:24:55,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:24:55,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:24:55,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:24:55,080 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_5dc12be2-2c35-486c-9dd1-962801af3c3e/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_5dc12be2-2c35-486c-9dd1-962801af3c3e/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 -> f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d [2024-11-08 16:24:55,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:24:55,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:24:55,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:24:55,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:24:55,392 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:24:55,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i Unable to find full path for "g++" [2024-11-08 16:24:57,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:24:57,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:24:57,561 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2024-11-08 16:24:57,575 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/data/950e441b9/ffe8b0ca632244a889fecbf5f4ad531b/FLAG367dbf37b [2024-11-08 16:24:57,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/data/950e441b9/ffe8b0ca632244a889fecbf5f4ad531b [2024-11-08 16:24:57,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:24:57,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:24:57,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:24:57,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:24:57,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:24:57,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:24:57" (1/1) ... [2024-11-08 16:24:57,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c64f443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:57, skipping insertion in model container [2024-11-08 16:24:57,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:24:57" (1/1) ... [2024-11-08 16:24:57,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:24:57,827 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_5dc12be2-2c35-486c-9dd1-962801af3c3e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i[917,930] [2024-11-08 16:24:57,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:24:57,912 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:24:57,926 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_5dc12be2-2c35-486c-9dd1-962801af3c3e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i[917,930] [2024-11-08 16:24:57,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:24:58,027 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:24:58,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58 WrapperNode [2024-11-08 16:24:58,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:24:58,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:24:58,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:24:58,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:24:58,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,087 INFO L138 Inliner]: procedures = 30, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-08 16:24:58,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:24:58,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:24:58,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:24:58,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:24:58,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,112 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:24:58,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:24:58,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:24:58,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:24:58,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:24:58,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (1/1) ... [2024-11-08 16:24:58,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:24:58,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:24:58,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:24:58,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:24:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:24:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:24:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:24:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:24:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:24:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:24:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:24:58,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:24:58,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:24:58,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:24:58,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:24:58,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:24:58,413 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:24:58,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:24:59,073 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 16:24:59,073 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:24:59,088 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:24:59,088 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:24:59,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:59 BoogieIcfgContainer [2024-11-08 16:24:59,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:24:59,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:24:59,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:24:59,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:24:59,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:24:57" (1/3) ... [2024-11-08 16:24:59,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dbfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:24:59, skipping insertion in model container [2024-11-08 16:24:59,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:24:58" (2/3) ... [2024-11-08 16:24:59,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dbfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:24:59, skipping insertion in model container [2024-11-08 16:24:59,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:59" (3/3) ... [2024-11-08 16:24:59,098 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-15.i [2024-11-08 16:24:59,120 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:24:59,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:24:59,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:24:59,202 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;@5e7aed5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:24:59,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:24:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:24:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:24:59,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:59,221 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:59,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:59,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2028094036, now seen corresponding path program 1 times [2024-11-08 16:24:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146079291] [2024-11-08 16:24:59,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:24:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:24:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:24:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:24:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:24:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:24:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:24:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:24:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:24:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:24:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:24:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:24:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:24:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:24:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:24:59,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146079291] [2024-11-08 16:24:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146079291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:24:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:24:59,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:24:59,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613124350] [2024-11-08 16:24:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:24:59,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:24:59,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:24:59,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:24:59,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:24:59,761 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:24:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:24:59,793 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-08 16:24:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:24:59,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-08 16:24:59,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:24:59,804 INFO L225 Difference]: With dead ends: 219 [2024-11-08 16:24:59,804 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 16:24:59,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:24:59,813 INFO L432 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:24:59,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:24:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 16:24:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 16:24:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:24:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-08 16:24:59,860 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-08 16:24:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:24:59,861 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-08 16:24:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:24:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-08 16:24:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:24:59,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:24:59,865 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:24:59,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:24:59,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:24:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:24:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1070488292, now seen corresponding path program 1 times [2024-11-08 16:24:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:24:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472821766] [2024-11-08 16:24:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:24:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:24:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472821766] [2024-11-08 16:25:00,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472821766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:00,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:00,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:25:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145219900] [2024-11-08 16:25:00,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:00,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:25:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:00,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:25:00,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:25:00,467 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:00,512 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2024-11-08 16:25:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:25:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 16:25:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:00,516 INFO L225 Difference]: With dead ends: 213 [2024-11-08 16:25:00,516 INFO L226 Difference]: Without dead ends: 107 [2024-11-08 16:25:00,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:25:00,521 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:00,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:25:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-08 16:25:00,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-08 16:25:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:25:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-11-08 16:25:00,544 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 115 [2024-11-08 16:25:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:00,546 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-11-08 16:25:00,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-11-08 16:25:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:25:00,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:00,550 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:00,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:25:00,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:00,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1198652059, now seen corresponding path program 1 times [2024-11-08 16:25:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461011721] [2024-11-08 16:25:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:00,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461011721] [2024-11-08 16:25:00,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461011721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:00,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:00,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:25:00,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903187303] [2024-11-08 16:25:00,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:00,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:25:00,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:25:00,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:25:00,864 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:00,887 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-11-08 16:25:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:25:00,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 16:25:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:00,889 INFO L225 Difference]: With dead ends: 212 [2024-11-08 16:25:00,889 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 16:25:00,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:25:00,891 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:00,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:25:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 16:25:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 16:25:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:25:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-08 16:25:00,901 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 115 [2024-11-08 16:25:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:00,902 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-08 16:25:00,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-08 16:25:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:25:00,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:00,904 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:25:00,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:00,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:00,917 INFO L85 PathProgramCache]: Analyzing trace with hash -940486621, now seen corresponding path program 1 times [2024-11-08 16:25:00,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:00,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476100031] [2024-11-08 16:25:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:01,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:02,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:02,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476100031] [2024-11-08 16:25:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476100031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:02,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:25:02,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723582622] [2024-11-08 16:25:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:02,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:25:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:02,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:25:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:25:02,122 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:02,730 INFO L93 Difference]: Finished difference Result 257 states and 365 transitions. [2024-11-08 16:25:02,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:25:02,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 16:25:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:02,737 INFO L225 Difference]: With dead ends: 257 [2024-11-08 16:25:02,737 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 16:25:02,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:02,743 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 179 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:02,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 577 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:25:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 16:25:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2024-11-08 16:25:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 103 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:25:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-11-08 16:25:02,768 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 115 [2024-11-08 16:25:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:02,769 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-11-08 16:25:02,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-11-08 16:25:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 16:25:02,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:02,775 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:02,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:25:02,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:02,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1120948030, now seen corresponding path program 1 times [2024-11-08 16:25:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781174084] [2024-11-08 16:25:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:02,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781174084] [2024-11-08 16:25:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781174084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:03,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:03,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:25:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969593177] [2024-11-08 16:25:03,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:03,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:25:03,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:03,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:25:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:03,987 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:04,539 INFO L93 Difference]: Finished difference Result 288 states and 408 transitions. [2024-11-08 16:25:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:25:04,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-08 16:25:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:04,541 INFO L225 Difference]: With dead ends: 288 [2024-11-08 16:25:04,541 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 16:25:04,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:04,543 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 163 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:04,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 575 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:25:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 16:25:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2024-11-08 16:25:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:25:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-11-08 16:25:04,560 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 116 [2024-11-08 16:25:04,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:04,560 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-11-08 16:25:04,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-11-08 16:25:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 16:25:04,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:04,564 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:04,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:25:04,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:04,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -303299580, now seen corresponding path program 1 times [2024-11-08 16:25:04,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:04,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663952568] [2024-11-08 16:25:04,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:06,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:06,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:06,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:06,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:07,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:07,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:07,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:07,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:07,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:07,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663952568] [2024-11-08 16:25:07,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663952568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:07,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:07,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:25:07,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389158574] [2024-11-08 16:25:07,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:07,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:25:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:25:07,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:07,123 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:07,717 INFO L93 Difference]: Finished difference Result 371 states and 533 transitions. [2024-11-08 16:25:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:25:07,718 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-11-08 16:25:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:07,720 INFO L225 Difference]: With dead ends: 371 [2024-11-08 16:25:07,721 INFO L226 Difference]: Without dead ends: 248 [2024-11-08 16:25:07,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:25:07,722 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 109 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:07,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 668 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:25:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-08 16:25:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2024-11-08 16:25:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 199 states have internal predecessors, (277), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 16:25:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 325 transitions. [2024-11-08 16:25:07,782 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 325 transitions. Word has length 116 [2024-11-08 16:25:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:07,782 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 325 transitions. [2024-11-08 16:25:07,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 325 transitions. [2024-11-08 16:25:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 16:25:07,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:07,786 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:07,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:25:07,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash -475258857, now seen corresponding path program 1 times [2024-11-08 16:25:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:07,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530795337] [2024-11-08 16:25:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:07,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:09,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530795337] [2024-11-08 16:25:09,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530795337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:09,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:09,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:25:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929880375] [2024-11-08 16:25:09,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:09,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:25:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:09,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:25:09,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:25:09,310 INFO L87 Difference]: Start difference. First operand 226 states and 325 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:09,696 INFO L93 Difference]: Finished difference Result 519 states and 750 transitions. [2024-11-08 16:25:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:25:09,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-08 16:25:09,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:09,699 INFO L225 Difference]: With dead ends: 519 [2024-11-08 16:25:09,700 INFO L226 Difference]: Without dead ends: 296 [2024-11-08 16:25:09,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:09,703 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 61 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:09,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 507 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:25:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-08 16:25:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 287. [2024-11-08 16:25:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 247 states have (on average 1.3765182186234817) internal successors, (340), 247 states have internal predecessors, (340), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 412 transitions. [2024-11-08 16:25:09,747 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 412 transitions. Word has length 117 [2024-11-08 16:25:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 412 transitions. [2024-11-08 16:25:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 412 transitions. [2024-11-08 16:25:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:25:09,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:09,751 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:09,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:25:09,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1733343753, now seen corresponding path program 1 times [2024-11-08 16:25:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966618937] [2024-11-08 16:25:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966618937] [2024-11-08 16:25:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966618937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:25:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719885614] [2024-11-08 16:25:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:10,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:25:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:10,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:25:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:25:10,768 INFO L87 Difference]: Start difference. First operand 287 states and 412 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:11,184 INFO L93 Difference]: Finished difference Result 595 states and 848 transitions. [2024-11-08 16:25:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:25:11,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 16:25:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:11,186 INFO L225 Difference]: With dead ends: 595 [2024-11-08 16:25:11,186 INFO L226 Difference]: Without dead ends: 371 [2024-11-08 16:25:11,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:11,190 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 209 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:11,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 466 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:25:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-08 16:25:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 295. [2024-11-08 16:25:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 255 states have (on average 1.3686274509803922) internal successors, (349), 255 states have internal predecessors, (349), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 421 transitions. [2024-11-08 16:25:11,247 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 421 transitions. Word has length 118 [2024-11-08 16:25:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:11,248 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 421 transitions. [2024-11-08 16:25:11,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2024-11-08 16:25:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:25:11,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:11,250 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:11,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:25:11,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:11,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2099981066, now seen corresponding path program 1 times [2024-11-08 16:25:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:11,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501089247] [2024-11-08 16:25:11,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:11,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:11,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501089247] [2024-11-08 16:25:11,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501089247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:11,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:11,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:25:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721136387] [2024-11-08 16:25:11,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:11,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:25:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:11,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:25:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:11,914 INFO L87 Difference]: Start difference. First operand 295 states and 421 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:12,370 INFO L93 Difference]: Finished difference Result 624 states and 882 transitions. [2024-11-08 16:25:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:25:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-08 16:25:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:12,373 INFO L225 Difference]: With dead ends: 624 [2024-11-08 16:25:12,374 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 16:25:12,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:25:12,375 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 217 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:12,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 855 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:25:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 16:25:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 327. [2024-11-08 16:25:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 287 states have (on average 1.3554006968641115) internal successors, (389), 287 states have internal predecessors, (389), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 461 transitions. [2024-11-08 16:25:12,423 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 461 transitions. Word has length 118 [2024-11-08 16:25:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:12,424 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 461 transitions. [2024-11-08 16:25:12,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 461 transitions. [2024-11-08 16:25:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:25:12,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:12,426 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:12,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:25:12,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:12,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1763824974, now seen corresponding path program 1 times [2024-11-08 16:25:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975142515] [2024-11-08 16:25:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:12,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:13,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:13,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975142515] [2024-11-08 16:25:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975142515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:25:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655469218] [2024-11-08 16:25:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:13,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:25:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:25:13,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:25:13,021 INFO L87 Difference]: Start difference. First operand 327 states and 461 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:13,472 INFO L93 Difference]: Finished difference Result 477 states and 671 transitions. [2024-11-08 16:25:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:25:13,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-08 16:25:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:13,475 INFO L225 Difference]: With dead ends: 477 [2024-11-08 16:25:13,475 INFO L226 Difference]: Without dead ends: 340 [2024-11-08 16:25:13,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:13,476 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 129 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:13,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 406 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:25:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-08 16:25:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 329. [2024-11-08 16:25:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 289 states have (on average 1.3529411764705883) internal successors, (391), 289 states have internal predecessors, (391), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 463 transitions. [2024-11-08 16:25:13,522 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 463 transitions. Word has length 119 [2024-11-08 16:25:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:13,522 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 463 transitions. [2024-11-08 16:25:13,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 463 transitions. [2024-11-08 16:25:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:25:13,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:13,524 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:25:13,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:13,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1909502686, now seen corresponding path program 1 times [2024-11-08 16:25:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316827624] [2024-11-08 16:25:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:14,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:14,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316827624] [2024-11-08 16:25:14,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316827624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:14,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:14,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:25:14,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183187052] [2024-11-08 16:25:14,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:14,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:25:14,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:25:14,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:25:14,401 INFO L87 Difference]: Start difference. First operand 329 states and 463 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:14,962 INFO L93 Difference]: Finished difference Result 649 states and 907 transitions. [2024-11-08 16:25:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:25:14,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-08 16:25:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:14,966 INFO L225 Difference]: With dead ends: 649 [2024-11-08 16:25:14,966 INFO L226 Difference]: Without dead ends: 354 [2024-11-08 16:25:14,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:14,968 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 423 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:14,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 313 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:25:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-08 16:25:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 314. [2024-11-08 16:25:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 274 states have (on average 1.3284671532846715) internal successors, (364), 274 states have internal predecessors, (364), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 436 transitions. [2024-11-08 16:25:15,018 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 436 transitions. Word has length 119 [2024-11-08 16:25:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:15,018 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 436 transitions. [2024-11-08 16:25:15,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 436 transitions. [2024-11-08 16:25:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:25:15,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:15,020 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:15,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:25:15,021 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:15,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1374347360, now seen corresponding path program 1 times [2024-11-08 16:25:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:15,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926145098] [2024-11-08 16:25:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:17,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:17,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:17,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:17,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:17,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926145098] [2024-11-08 16:25:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926145098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:17,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:25:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737772405] [2024-11-08 16:25:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:17,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:25:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:25:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:17,033 INFO L87 Difference]: Start difference. First operand 314 states and 436 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:18,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:18,308 INFO L93 Difference]: Finished difference Result 585 states and 811 transitions. [2024-11-08 16:25:18,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:25:18,309 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-08 16:25:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:18,311 INFO L225 Difference]: With dead ends: 585 [2024-11-08 16:25:18,311 INFO L226 Difference]: Without dead ends: 335 [2024-11-08 16:25:18,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:25:18,313 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 133 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:18,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 756 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:25:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-08 16:25:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 321. [2024-11-08 16:25:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 281 states have (on average 1.3238434163701067) internal successors, (372), 281 states have internal predecessors, (372), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 444 transitions. [2024-11-08 16:25:18,346 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 444 transitions. Word has length 119 [2024-11-08 16:25:18,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:18,347 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 444 transitions. [2024-11-08 16:25:18,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 444 transitions. [2024-11-08 16:25:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:25:18,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:18,349 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:18,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:25:18,349 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:18,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:18,350 INFO L85 PathProgramCache]: Analyzing trace with hash 864874270, now seen corresponding path program 1 times [2024-11-08 16:25:18,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:18,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568780814] [2024-11-08 16:25:18,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:22,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:22,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568780814] [2024-11-08 16:25:22,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568780814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:22,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:22,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:25:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231278257] [2024-11-08 16:25:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:25:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:22,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:25:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:25:22,862 INFO L87 Difference]: Start difference. First operand 321 states and 444 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:25:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:25,616 INFO L93 Difference]: Finished difference Result 682 states and 935 transitions. [2024-11-08 16:25:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:25:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2024-11-08 16:25:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:25,619 INFO L225 Difference]: With dead ends: 682 [2024-11-08 16:25:25,619 INFO L226 Difference]: Without dead ends: 432 [2024-11-08 16:25:25,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:25:25,620 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 428 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:25,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1240 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:25:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-08 16:25:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 341. [2024-11-08 16:25:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.3222591362126246) internal successors, (398), 301 states have internal predecessors, (398), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 470 transitions. [2024-11-08 16:25:25,660 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 470 transitions. Word has length 119 [2024-11-08 16:25:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:25,661 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 470 transitions. [2024-11-08 16:25:25,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 15 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:25:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 470 transitions. [2024-11-08 16:25:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:25:25,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:25,663 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:25,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:25:25,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1149963637, now seen corresponding path program 1 times [2024-11-08 16:25:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236805746] [2024-11-08 16:25:25,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:26,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236805746] [2024-11-08 16:25:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236805746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:25:26,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185597621] [2024-11-08 16:25:26,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:26,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:25:26,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:26,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:25:26,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:26,882 INFO L87 Difference]: Start difference. First operand 341 states and 470 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:25:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:27,436 INFO L93 Difference]: Finished difference Result 605 states and 834 transitions. [2024-11-08 16:25:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:25:27,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2024-11-08 16:25:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:27,439 INFO L225 Difference]: With dead ends: 605 [2024-11-08 16:25:27,439 INFO L226 Difference]: Without dead ends: 337 [2024-11-08 16:25:27,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:25:27,441 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 131 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:27,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 412 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:25:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-08 16:25:27,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 327. [2024-11-08 16:25:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 287 states have (on average 1.3205574912891986) internal successors, (379), 287 states have internal predecessors, (379), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 451 transitions. [2024-11-08 16:25:27,503 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 451 transitions. Word has length 119 [2024-11-08 16:25:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:27,504 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 451 transitions. [2024-11-08 16:25:27,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:25:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 451 transitions. [2024-11-08 16:25:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 16:25:27,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:27,506 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:27,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:25:27,506 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:27,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1854528985, now seen corresponding path program 1 times [2024-11-08 16:25:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:27,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895317136] [2024-11-08 16:25:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:27,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:30,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895317136] [2024-11-08 16:25:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895317136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:30,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:30,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:25:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029034392] [2024-11-08 16:25:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:30,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:25:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:30,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:25:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:25:30,341 INFO L87 Difference]: Start difference. First operand 327 states and 451 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:31,515 INFO L93 Difference]: Finished difference Result 661 states and 902 transitions. [2024-11-08 16:25:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:25:31,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-08 16:25:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:31,519 INFO L225 Difference]: With dead ends: 661 [2024-11-08 16:25:31,519 INFO L226 Difference]: Without dead ends: 394 [2024-11-08 16:25:31,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:25:31,524 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 391 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:31,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 624 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:25:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-08 16:25:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 349. [2024-11-08 16:25:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 309 states have (on average 1.3106796116504855) internal successors, (405), 309 states have internal predecessors, (405), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 477 transitions. [2024-11-08 16:25:31,573 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 477 transitions. Word has length 120 [2024-11-08 16:25:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:31,573 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 477 transitions. [2024-11-08 16:25:31,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 477 transitions. [2024-11-08 16:25:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 16:25:31,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:31,575 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:25:31,576 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:31,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1054234917, now seen corresponding path program 1 times [2024-11-08 16:25:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:31,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576694523] [2024-11-08 16:25:31,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:31,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:35,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576694523] [2024-11-08 16:25:35,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576694523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:35,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 16:25:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546508387] [2024-11-08 16:25:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:35,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 16:25:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:35,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 16:25:35,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:25:35,268 INFO L87 Difference]: Start difference. First operand 349 states and 477 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:37,831 INFO L93 Difference]: Finished difference Result 668 states and 907 transitions. [2024-11-08 16:25:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:25:37,832 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-08 16:25:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:37,834 INFO L225 Difference]: With dead ends: 668 [2024-11-08 16:25:37,835 INFO L226 Difference]: Without dead ends: 387 [2024-11-08 16:25:37,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:25:37,836 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 543 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:37,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1185 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 16:25:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-08 16:25:37,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 341. [2024-11-08 16:25:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.3122923588039868) internal successors, (395), 301 states have internal predecessors, (395), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 467 transitions. [2024-11-08 16:25:37,890 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 467 transitions. Word has length 120 [2024-11-08 16:25:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:37,891 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 467 transitions. [2024-11-08 16:25:37,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:25:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 467 transitions. [2024-11-08 16:25:37,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:25:37,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:37,893 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:37,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:25:37,894 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:37,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:37,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1465521541, now seen corresponding path program 1 times [2024-11-08 16:25:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775912762] [2024-11-08 16:25:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:39,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775912762] [2024-11-08 16:25:39,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775912762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:39,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:39,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:25:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134763388] [2024-11-08 16:25:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:39,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:25:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:39,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:25:39,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:25:39,916 INFO L87 Difference]: Start difference. First operand 341 states and 467 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:42,080 INFO L93 Difference]: Finished difference Result 725 states and 976 transitions. [2024-11-08 16:25:42,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:25:42,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-08 16:25:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:42,084 INFO L225 Difference]: With dead ends: 725 [2024-11-08 16:25:42,084 INFO L226 Difference]: Without dead ends: 584 [2024-11-08 16:25:42,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-11-08 16:25:42,087 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 301 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:42,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1131 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:25:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-08 16:25:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 356. [2024-11-08 16:25:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 316 states have (on average 1.3101265822784811) internal successors, (414), 316 states have internal predecessors, (414), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 486 transitions. [2024-11-08 16:25:42,158 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 486 transitions. Word has length 121 [2024-11-08 16:25:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:42,158 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 486 transitions. [2024-11-08 16:25:42,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 486 transitions. [2024-11-08 16:25:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:25:42,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:42,161 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:42,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:25:42,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:42,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:42,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1442889287, now seen corresponding path program 1 times [2024-11-08 16:25:42,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:42,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820692462] [2024-11-08 16:25:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:42,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:43,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:43,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820692462] [2024-11-08 16:25:43,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820692462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:43,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:43,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:25:43,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550740954] [2024-11-08 16:25:43,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:43,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:25:43,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:25:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:43,480 INFO L87 Difference]: Start difference. First operand 356 states and 486 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:25:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:44,148 INFO L93 Difference]: Finished difference Result 505 states and 688 transitions. [2024-11-08 16:25:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:25:44,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 121 [2024-11-08 16:25:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:44,151 INFO L225 Difference]: With dead ends: 505 [2024-11-08 16:25:44,152 INFO L226 Difference]: Without dead ends: 349 [2024-11-08 16:25:44,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:25:44,153 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 240 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:44,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 470 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:25:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-08 16:25:44,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 341. [2024-11-08 16:25:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 301 states have (on average 1.2956810631229236) internal successors, (390), 301 states have internal predecessors, (390), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2024-11-08 16:25:44,210 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 121 [2024-11-08 16:25:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:44,211 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2024-11-08 16:25:44,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:25:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2024-11-08 16:25:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:25:44,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:44,213 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:44,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:25:44,213 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:44,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash 243290691, now seen corresponding path program 1 times [2024-11-08 16:25:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:44,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32937369] [2024-11-08 16:25:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:44,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:44,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:44,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32937369] [2024-11-08 16:25:44,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32937369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:44,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:25:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623590446] [2024-11-08 16:25:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:44,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:25:44,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:44,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:25:44,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:44,862 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:45,409 INFO L93 Difference]: Finished difference Result 716 states and 964 transitions. [2024-11-08 16:25:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:25:45,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-08 16:25:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:45,413 INFO L225 Difference]: With dead ends: 716 [2024-11-08 16:25:45,413 INFO L226 Difference]: Without dead ends: 443 [2024-11-08 16:25:45,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:25:45,414 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 203 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:45,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 858 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:25:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-08 16:25:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 367. [2024-11-08 16:25:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 327 states have (on average 1.290519877675841) internal successors, (422), 327 states have internal predecessors, (422), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 494 transitions. [2024-11-08 16:25:45,471 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 494 transitions. Word has length 121 [2024-11-08 16:25:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:45,471 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 494 transitions. [2024-11-08 16:25:45,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 494 transitions. [2024-11-08 16:25:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:25:45,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:45,473 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:45,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:25:45,473 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:45,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash 462145409, now seen corresponding path program 1 times [2024-11-08 16:25:45,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:45,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998109885] [2024-11-08 16:25:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998109885] [2024-11-08 16:25:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998109885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:25:45,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473101537] [2024-11-08 16:25:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:45,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:25:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:45,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:25:45,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:25:45,912 INFO L87 Difference]: Start difference. First operand 367 states and 494 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:46,314 INFO L93 Difference]: Finished difference Result 731 states and 981 transitions. [2024-11-08 16:25:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:25:46,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-08 16:25:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:46,317 INFO L225 Difference]: With dead ends: 731 [2024-11-08 16:25:46,317 INFO L226 Difference]: Without dead ends: 432 [2024-11-08 16:25:46,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:25:46,319 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 152 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:46,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 595 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:25:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-08 16:25:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 367. [2024-11-08 16:25:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 327 states have (on average 1.2874617737003058) internal successors, (421), 327 states have internal predecessors, (421), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 493 transitions. [2024-11-08 16:25:46,380 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 493 transitions. Word has length 121 [2024-11-08 16:25:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:46,380 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 493 transitions. [2024-11-08 16:25:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 493 transitions. [2024-11-08 16:25:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:25:46,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:46,382 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:46,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:25:46,383 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:46,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1945052752, now seen corresponding path program 1 times [2024-11-08 16:25:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:46,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938644558] [2024-11-08 16:25:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:47,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:47,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938644558] [2024-11-08 16:25:47,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938644558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:47,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:47,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:25:47,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856970488] [2024-11-08 16:25:47,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:47,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:25:47,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:47,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:25:47,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:25:47,569 INFO L87 Difference]: Start difference. First operand 367 states and 493 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:48,199 INFO L93 Difference]: Finished difference Result 590 states and 792 transitions. [2024-11-08 16:25:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:25:48,200 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-08 16:25:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:48,203 INFO L225 Difference]: With dead ends: 590 [2024-11-08 16:25:48,203 INFO L226 Difference]: Without dead ends: 432 [2024-11-08 16:25:48,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:25:48,204 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 202 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:48,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 502 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:25:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-08 16:25:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 368. [2024-11-08 16:25:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 328 states have (on average 1.2835365853658536) internal successors, (421), 328 states have internal predecessors, (421), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 493 transitions. [2024-11-08 16:25:48,250 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 493 transitions. Word has length 121 [2024-11-08 16:25:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:48,251 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 493 transitions. [2024-11-08 16:25:48,251 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 493 transitions. [2024-11-08 16:25:48,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:25:48,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:48,253 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:48,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:25:48,253 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:48,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2033945342, now seen corresponding path program 1 times [2024-11-08 16:25:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272443187] [2024-11-08 16:25:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:50,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:50,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272443187] [2024-11-08 16:25:50,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272443187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:50,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:50,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 16:25:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884703123] [2024-11-08 16:25:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:50,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 16:25:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 16:25:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:25:50,059 INFO L87 Difference]: Start difference. First operand 368 states and 493 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:51,519 INFO L93 Difference]: Finished difference Result 841 states and 1112 transitions. [2024-11-08 16:25:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:25:51,520 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-08 16:25:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:51,522 INFO L225 Difference]: With dead ends: 841 [2024-11-08 16:25:51,523 INFO L226 Difference]: Without dead ends: 541 [2024-11-08 16:25:51,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-11-08 16:25:51,525 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 198 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:51,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1220 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:25:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-08 16:25:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 386. [2024-11-08 16:25:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 346 states have (on average 1.277456647398844) internal successors, (442), 346 states have internal predecessors, (442), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 514 transitions. [2024-11-08 16:25:51,589 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 514 transitions. Word has length 122 [2024-11-08 16:25:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:51,589 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 514 transitions. [2024-11-08 16:25:51,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 514 transitions. [2024-11-08 16:25:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:25:51,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:51,591 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:51,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 16:25:51,592 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1332880764, now seen corresponding path program 1 times [2024-11-08 16:25:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:51,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031802752] [2024-11-08 16:25:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:53,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:53,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031802752] [2024-11-08 16:25:53,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031802752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:53,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:53,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:25:53,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145166703] [2024-11-08 16:25:53,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:53,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:25:53,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:53,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:25:53,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:25:53,412 INFO L87 Difference]: Start difference. First operand 386 states and 514 transitions. Second operand has 10 states, 8 states have (on average 8.125) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 16:25:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:54,502 INFO L93 Difference]: Finished difference Result 803 states and 1065 transitions. [2024-11-08 16:25:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:25:54,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.125) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2024-11-08 16:25:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:54,507 INFO L225 Difference]: With dead ends: 803 [2024-11-08 16:25:54,507 INFO L226 Difference]: Without dead ends: 503 [2024-11-08 16:25:54,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:25:54,509 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 223 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:54,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 491 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:25:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-08 16:25:54,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 455. [2024-11-08 16:25:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 415 states have (on average 1.269879518072289) internal successors, (527), 415 states have internal predecessors, (527), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 599 transitions. [2024-11-08 16:25:54,609 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 599 transitions. Word has length 122 [2024-11-08 16:25:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:54,609 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 599 transitions. [2024-11-08 16:25:54,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.125) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-08 16:25:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 599 transitions. [2024-11-08 16:25:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:25:54,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:54,611 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:54,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 16:25:54,612 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:54,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1733310643, now seen corresponding path program 1 times [2024-11-08 16:25:54,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:54,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714884030] [2024-11-08 16:25:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:54,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:54,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:54,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714884030] [2024-11-08 16:25:54,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714884030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:54,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:25:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704689467] [2024-11-08 16:25:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:54,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:25:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:25:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:25:54,925 INFO L87 Difference]: Start difference. First operand 455 states and 599 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:55,173 INFO L93 Difference]: Finished difference Result 865 states and 1139 transitions. [2024-11-08 16:25:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:25:55,174 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-08 16:25:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:55,177 INFO L225 Difference]: With dead ends: 865 [2024-11-08 16:25:55,177 INFO L226 Difference]: Without dead ends: 496 [2024-11-08 16:25:55,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:25:55,178 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 81 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:55,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 372 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:25:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-08 16:25:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 471. [2024-11-08 16:25:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 431 states have (on average 1.259860788863109) internal successors, (543), 431 states have internal predecessors, (543), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 615 transitions. [2024-11-08 16:25:55,243 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 615 transitions. Word has length 122 [2024-11-08 16:25:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:55,243 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 615 transitions. [2024-11-08 16:25:55,244 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 615 transitions. [2024-11-08 16:25:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:25:55,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:55,245 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:55,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 16:25:55,245 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:55,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1332345468, now seen corresponding path program 1 times [2024-11-08 16:25:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341232865] [2024-11-08 16:25:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:25:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:25:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:25:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:25:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341232865] [2024-11-08 16:25:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341232865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:56,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:25:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22707855] [2024-11-08 16:25:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:56,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:25:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:25:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:25:56,132 INFO L87 Difference]: Start difference. First operand 471 states and 615 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:56,697 INFO L93 Difference]: Finished difference Result 901 states and 1179 transitions. [2024-11-08 16:25:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:25:56,698 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-08 16:25:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:56,700 INFO L225 Difference]: With dead ends: 901 [2024-11-08 16:25:56,701 INFO L226 Difference]: Without dead ends: 516 [2024-11-08 16:25:56,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:25:56,705 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 156 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:56,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 500 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:25:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-08 16:25:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 472. [2024-11-08 16:25:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 432 states have (on average 1.2569444444444444) internal successors, (543), 432 states have internal predecessors, (543), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:25:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 615 transitions. [2024-11-08 16:25:56,775 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 615 transitions. Word has length 122 [2024-11-08 16:25:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:56,775 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 615 transitions. [2024-11-08 16:25:56,776 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:25:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 615 transitions. [2024-11-08 16:25:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:25:56,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:56,778 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:56,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 16:25:56,778 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash -631280890, now seen corresponding path program 1 times [2024-11-08 16:25:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858349107] [2024-11-08 16:25:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:26:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:26:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:26:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:26:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858349107] [2024-11-08 16:26:01,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858349107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:01,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:01,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 16:26:01,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953687716] [2024-11-08 16:26:01,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:01,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:26:01,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:01,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:26:01,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:26:01,603 INFO L87 Difference]: Start difference. First operand 472 states and 615 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:26:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:06,357 INFO L93 Difference]: Finished difference Result 920 states and 1195 transitions. [2024-11-08 16:26:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:26:06,357 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-08 16:26:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:06,361 INFO L225 Difference]: With dead ends: 920 [2024-11-08 16:26:06,361 INFO L226 Difference]: Without dead ends: 534 [2024-11-08 16:26:06,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2024-11-08 16:26:06,363 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 487 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:06,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1859 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 16:26:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-08 16:26:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 477. [2024-11-08 16:26:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 437 states have (on average 1.2540045766590389) internal successors, (548), 437 states have internal predecessors, (548), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:26:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 620 transitions. [2024-11-08 16:26:06,453 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 620 transitions. Word has length 122 [2024-11-08 16:26:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:06,454 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 620 transitions. [2024-11-08 16:26:06,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:26:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 620 transitions. [2024-11-08 16:26:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 16:26:06,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:06,457 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:06,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 16:26:06,458 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:06,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2107731629, now seen corresponding path program 1 times [2024-11-08 16:26:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:06,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102840915] [2024-11-08 16:26:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:26:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:26:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:26:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:26:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102840915] [2024-11-08 16:26:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102840915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:09,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:09,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 16:26:09,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098275811] [2024-11-08 16:26:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:26:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:09,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:26:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:26:09,541 INFO L87 Difference]: Start difference. First operand 477 states and 620 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:26:22,752 WARN L286 SmtUtils]: Spent 12.18s on a formula simplification. DAG size of input: 74 DAG size of output: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:26:35,031 WARN L286 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 69 DAG size of output: 68 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:26:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:35,680 INFO L93 Difference]: Finished difference Result 779 states and 1003 transitions. [2024-11-08 16:26:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:26:35,681 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-11-08 16:26:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:35,684 INFO L225 Difference]: With dead ends: 779 [2024-11-08 16:26:35,684 INFO L226 Difference]: Without dead ends: 548 [2024-11-08 16:26:35,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:26:35,686 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 361 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:35,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 650 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 16:26:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-08 16:26:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 476. [2024-11-08 16:26:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 434 states have (on average 1.23963133640553) internal successors, (538), 434 states have internal predecessors, (538), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:26:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 610 transitions. [2024-11-08 16:26:35,763 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 610 transitions. Word has length 122 [2024-11-08 16:26:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:35,764 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 610 transitions. [2024-11-08 16:26:35,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:26:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 610 transitions. [2024-11-08 16:26:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 16:26:35,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:35,765 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:35,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 16:26:35,766 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -789574572, now seen corresponding path program 1 times [2024-11-08 16:26:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:35,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120104173] [2024-11-08 16:26:35,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:26:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:26:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:26:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:26:35,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:35,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120104173] [2024-11-08 16:26:35,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120104173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:35,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:26:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883685614] [2024-11-08 16:26:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:35,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:26:35,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:35,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:26:35,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:35,966 INFO L87 Difference]: Start difference. First operand 476 states and 610 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:36,059 INFO L93 Difference]: Finished difference Result 876 states and 1120 transitions. [2024-11-08 16:26:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:26:36,060 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-08 16:26:36,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:36,062 INFO L225 Difference]: With dead ends: 876 [2024-11-08 16:26:36,062 INFO L226 Difference]: Without dead ends: 482 [2024-11-08 16:26:36,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:36,064 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:36,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:26:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-08 16:26:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2024-11-08 16:26:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 440 states have (on average 1.2363636363636363) internal successors, (544), 440 states have internal predecessors, (544), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:26:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 616 transitions. [2024-11-08 16:26:36,129 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 616 transitions. Word has length 124 [2024-11-08 16:26:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:36,129 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 616 transitions. [2024-11-08 16:26:36,130 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 616 transitions. [2024-11-08 16:26:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 16:26:36,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:36,131 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:36,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 16:26:36,132 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 775626966, now seen corresponding path program 1 times [2024-11-08 16:26:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:36,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82268452] [2024-11-08 16:26:36,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:26:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:26:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:26:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:26:36,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:36,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82268452] [2024-11-08 16:26:36,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82268452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:36,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:26:36,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358857265] [2024-11-08 16:26:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:36,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:26:36,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:36,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:26:36,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:36,408 INFO L87 Difference]: Start difference. First operand 482 states and 616 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:36,680 INFO L93 Difference]: Finished difference Result 736 states and 938 transitions. [2024-11-08 16:26:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:26:36,681 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-08 16:26:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:36,683 INFO L225 Difference]: With dead ends: 736 [2024-11-08 16:26:36,683 INFO L226 Difference]: Without dead ends: 507 [2024-11-08 16:26:36,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:26:36,685 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 39 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:36,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 519 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:26:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-08 16:26:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 481. [2024-11-08 16:26:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 439 states have (on average 1.2323462414578588) internal successors, (541), 439 states have internal predecessors, (541), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:26:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 613 transitions. [2024-11-08 16:26:36,768 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 613 transitions. Word has length 124 [2024-11-08 16:26:36,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:36,769 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 613 transitions. [2024-11-08 16:26:36,769 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 613 transitions. [2024-11-08 16:26:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 16:26:36,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:36,772 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:36,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 16:26:36,772 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:36,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1076261665, now seen corresponding path program 1 times [2024-11-08 16:26:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209072039] [2024-11-08 16:26:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:26:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:26:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:26:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:26:39,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:39,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209072039] [2024-11-08 16:26:39,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209072039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:39,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:39,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 16:26:39,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691178472] [2024-11-08 16:26:39,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:39,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 16:26:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:39,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 16:26:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:26:39,815 INFO L87 Difference]: Start difference. First operand 481 states and 613 transitions. Second operand has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:26:41,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:41,810 INFO L93 Difference]: Finished difference Result 734 states and 933 transitions. [2024-11-08 16:26:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:26:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 124 [2024-11-08 16:26:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:41,813 INFO L225 Difference]: With dead ends: 734 [2024-11-08 16:26:41,813 INFO L226 Difference]: Without dead ends: 506 [2024-11-08 16:26:41,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2024-11-08 16:26:41,815 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 301 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:41,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1276 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 16:26:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-08 16:26:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 484. [2024-11-08 16:26:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 442 states have (on average 1.2307692307692308) internal successors, (544), 442 states have internal predecessors, (544), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:26:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 616 transitions. [2024-11-08 16:26:41,889 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 616 transitions. Word has length 124 [2024-11-08 16:26:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:41,890 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 616 transitions. [2024-11-08 16:26:41,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 20 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 16:26:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 616 transitions. [2024-11-08 16:26:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 16:26:41,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:41,892 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 16:26:41,892 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -884202221, now seen corresponding path program 1 times [2024-11-08 16:26:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140613781] [2024-11-08 16:26:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:26:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:26:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:26:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:26:44,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:44,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140613781] [2024-11-08 16:26:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140613781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:44,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:44,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 16:26:44,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070563042] [2024-11-08 16:26:44,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:44,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:26:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:26:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:26:44,101 INFO L87 Difference]: Start difference. First operand 484 states and 616 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:46,691 INFO L93 Difference]: Finished difference Result 1048 states and 1319 transitions. [2024-11-08 16:26:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:26:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-08 16:26:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:46,695 INFO L225 Difference]: With dead ends: 1048 [2024-11-08 16:26:46,695 INFO L226 Difference]: Without dead ends: 646 [2024-11-08 16:26:46,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-11-08 16:26:46,697 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 232 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:46,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1599 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 16:26:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-08 16:26:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 505. [2024-11-08 16:26:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 463 states have (on average 1.2311015118790496) internal successors, (570), 463 states have internal predecessors, (570), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:26:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 642 transitions. [2024-11-08 16:26:46,773 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 642 transitions. Word has length 125 [2024-11-08 16:26:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:46,773 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 642 transitions. [2024-11-08 16:26:46,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 642 transitions. [2024-11-08 16:26:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 16:26:46,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:46,775 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:46,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 16:26:46,775 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:46,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2053061465, now seen corresponding path program 1 times [2024-11-08 16:26:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:46,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081792103] [2024-11-08 16:26:46,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:46,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:46,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:46,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:46,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:26:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:26:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:26:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:26:47,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081792103] [2024-11-08 16:26:47,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081792103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:47,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:47,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:26:47,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117791351] [2024-11-08 16:26:47,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:47,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:26:47,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:47,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:26:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:47,010 INFO L87 Difference]: Start difference. First operand 505 states and 642 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:47,268 INFO L93 Difference]: Finished difference Result 924 states and 1171 transitions. [2024-11-08 16:26:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:26:47,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-08 16:26:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:47,271 INFO L225 Difference]: With dead ends: 924 [2024-11-08 16:26:47,272 INFO L226 Difference]: Without dead ends: 522 [2024-11-08 16:26:47,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:26:47,273 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 31 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:47,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 468 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:26:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-08 16:26:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 503. [2024-11-08 16:26:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 461 states have (on average 1.227765726681128) internal successors, (566), 461 states have internal predecessors, (566), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:26:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 638 transitions. [2024-11-08 16:26:47,347 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 638 transitions. Word has length 126 [2024-11-08 16:26:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:47,347 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 638 transitions. [2024-11-08 16:26:47,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 638 transitions. [2024-11-08 16:26:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 16:26:47,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:47,349 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:47,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 16:26:47,349 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:47,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1618523618, now seen corresponding path program 1 times [2024-11-08 16:26:47,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:47,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562459426] [2024-11-08 16:26:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 16:26:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 16:26:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:26:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:26:47,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562459426] [2024-11-08 16:26:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562459426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:26:47,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401884572] [2024-11-08 16:26:47,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:47,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:26:47,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:47,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:26:47,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:26:47,478 INFO L87 Difference]: Start difference. First operand 503 states and 638 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:47,552 INFO L93 Difference]: Finished difference Result 899 states and 1136 transitions. [2024-11-08 16:26:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:26:47,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 128 [2024-11-08 16:26:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:47,555 INFO L225 Difference]: With dead ends: 899 [2024-11-08 16:26:47,555 INFO L226 Difference]: Without dead ends: 499 [2024-11-08 16:26:47,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:26:47,557 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:47,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:26:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-08 16:26:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2024-11-08 16:26:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 457 states have (on average 1.2210065645514223) internal successors, (558), 457 states have internal predecessors, (558), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:26:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 630 transitions. [2024-11-08 16:26:47,629 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 630 transitions. Word has length 128 [2024-11-08 16:26:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:47,630 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 630 transitions. [2024-11-08 16:26:47,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:26:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 630 transitions. [2024-11-08 16:26:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 16:26:47,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:47,632 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:47,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 16:26:47,632 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:47,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash 937878957, now seen corresponding path program 1 times [2024-11-08 16:26:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:47,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673172380] [2024-11-08 16:26:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:26:47,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:26:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:26:47,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:26:47,934 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:26:47,935 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:26:47,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 16:26:47,940 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] [2024-11-08 16:26:48,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:26:48,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:26:48 BoogieIcfgContainer [2024-11-08 16:26:48,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:26:48,121 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:26:48,121 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:26:48,121 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:26:48,122 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:24:59" (3/4) ... [2024-11-08 16:26:48,124 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:26:48,125 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:26:48,126 INFO L158 Benchmark]: Toolchain (without parser) took 110527.75ms. Allocated memory was 132.1MB in the beginning and 966.8MB in the end (delta: 834.7MB). Free memory was 96.9MB in the beginning and 823.5MB in the end (delta: -726.5MB). Peak memory consumption was 109.5MB. Max. memory is 16.1GB. [2024-11-08 16:26:48,127 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 132.1MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:26:48,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.88ms. Allocated memory is still 132.1MB. Free memory was 96.5MB in the beginning and 79.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:26:48,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.77ms. Allocated memory is still 132.1MB. Free memory was 79.8MB in the beginning and 76.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:26:48,128 INFO L158 Benchmark]: Boogie Preprocessor took 52.10ms. Allocated memory is still 132.1MB. Free memory was 76.5MB in the beginning and 73.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:26:48,129 INFO L158 Benchmark]: RCFGBuilder took 948.52ms. Allocated memory is still 132.1MB. Free memory was 73.1MB in the beginning and 85.4MB in the end (delta: -12.4MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-11-08 16:26:48,129 INFO L158 Benchmark]: TraceAbstraction took 109029.12ms. Allocated memory was 132.1MB in the beginning and 966.8MB in the end (delta: 834.7MB). Free memory was 84.3MB in the beginning and 823.5MB in the end (delta: -739.2MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2024-11-08 16:26:48,129 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 966.8MB. Free memory is still 823.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:26:48,130 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.26ms. Allocated memory is still 132.1MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.88ms. Allocated memory is still 132.1MB. Free memory was 96.5MB in the beginning and 79.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.77ms. Allocated memory is still 132.1MB. Free memory was 79.8MB in the beginning and 76.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.10ms. Allocated memory is still 132.1MB. Free memory was 76.5MB in the beginning and 73.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 948.52ms. Allocated memory is still 132.1MB. Free memory was 73.1MB in the beginning and 85.4MB in the end (delta: -12.4MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 109029.12ms. Allocated memory was 132.1MB in the beginning and 966.8MB in the end (delta: 834.7MB). Free memory was 84.3MB in the beginning and 823.5MB in the end (delta: -739.2MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 966.8MB. Free memory is still 823.5MB. 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 someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 89. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L51] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L53] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] unsigned long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned long int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L57] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L63] signed long int last_1_WrapperStruct00_var_1_10 = -10; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=0, last_1_WrapperStruct00_var_1_10=-10] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_10 [L117] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L113] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L128] RET updateVariables() [L129] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L67] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L70] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L70] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L70] (*(WrapperStruct00_var_1_8_Pointer)) = ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))) [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L72] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L75] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_2_Pointer)); [L76] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L76] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_10_Pointer)); [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10] [L77] COND TRUE stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L78] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10] [L78] COND FALSE !(stepLocal_0 < (*(WrapperStruct00_var_1_8_Pointer))) [L83] (*(WrapperStruct00_var_1_1_Pointer)) = 2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L89] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L89] (*(WrapperStruct00_var_1_11_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2)) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))) [L120] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) [L120] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L120] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L120] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120-L121] return (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 108.8s, OverallIterations: 34, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 56.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6329 SdHoareTripleChecker+Valid, 22.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6323 mSDsluCounter, 22726 SdHoareTripleChecker+Invalid, 20.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18285 mSDsCounter, 592 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16374 IncrementalHoareTripleChecker+Invalid, 16966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 592 mSolverCounterUnsat, 4441 mSDtfsCounter, 16374 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1326 GetRequests, 947 SyntacticMatches, 14 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 37.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=31, InterpolantAutomatonStates: 253, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 1563 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 46.4s InterpolantComputationTime, 4096 NumberOfCodeBlocks, 4096 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3935 ConstructedInterpolants, 0 QuantifiedInterpolants, 48585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 8712/8712 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:26:48,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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_5dc12be2-2c35-486c-9dd1-962801af3c3e/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 f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:26:50,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:26:50,653 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:26:50,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:26:50,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:26:50,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:26:50,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:26:50,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:26:50,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:26:50,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:26:50,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:26:50,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:26:50,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:26:50,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:26:50,705 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:26:50,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:26:50,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:26:50,706 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:26:50,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:26:50,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:26:50,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:26:50,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:26:50,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:26:50,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:26:50,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:26:50,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:26:50,714 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:26:50,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:26:50,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:26:50,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:26:50,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:26:50,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:26:50,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:26:50,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:26:50,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:26:50,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:26:50,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:26:50,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:26:50,721 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:26:50,721 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:26:50,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:26:50,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:26:50,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:26:50,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:26:50,723 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_5dc12be2-2c35-486c-9dd1-962801af3c3e/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_5dc12be2-2c35-486c-9dd1-962801af3c3e/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 -> f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d [2024-11-08 16:26:51,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:26:51,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:26:51,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:26:51,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:26:51,171 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:26:51,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i Unable to find full path for "g++" [2024-11-08 16:26:53,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:26:53,424 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:26:53,425 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2024-11-08 16:26:53,441 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/data/a9c2bc7ff/88ac5c3ca47c46cfab9a52fc47c13ade/FLAG858483ae6 [2024-11-08 16:26:53,456 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/data/a9c2bc7ff/88ac5c3ca47c46cfab9a52fc47c13ade [2024-11-08 16:26:53,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:26:53,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:26:53,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:26:53,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:26:53,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:26:53,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:53,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d546a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53, skipping insertion in model container [2024-11-08 16:26:53,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:53,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:26:53,709 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_5dc12be2-2c35-486c-9dd1-962801af3c3e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i[917,930] [2024-11-08 16:26:53,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:26:53,818 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:26:53,837 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_5dc12be2-2c35-486c-9dd1-962801af3c3e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i[917,930] [2024-11-08 16:26:53,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:26:53,942 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:26:53,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53 WrapperNode [2024-11-08 16:26:53,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:26:53,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:26:53,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:26:53,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:26:53,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:53,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,056 INFO L138 Inliner]: procedures = 34, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2024-11-08 16:26:54,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:26:54,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:26:54,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:26:54,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:26:54,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,141 INFO L175 MemorySlicer]: Split 128 memory accesses to 2 slices as follows [2, 126]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-08 16:26:54,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:26:54,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:26:54,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:26:54,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:26:54,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (1/1) ... [2024-11-08 16:26:54,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:26:54,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:26:54,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:26:54,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:26:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:26:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:26:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:26:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-08 16:26:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-08 16:26:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:26:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:26:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:26:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:26:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 16:26:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 16:26:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:26:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:26:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:26:54,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:26:54,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:26:54,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:26:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:26:54,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:26:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:26:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:26:54,528 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:26:54,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:26:57,728 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-11-08 16:26:57,728 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:26:57,746 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:26:57,747 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:26:57,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:26:57 BoogieIcfgContainer [2024-11-08 16:26:57,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:26:57,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:26:57,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:26:57,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:26:57,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:26:53" (1/3) ... [2024-11-08 16:26:57,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a13c767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:26:57, skipping insertion in model container [2024-11-08 16:26:57,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:26:53" (2/3) ... [2024-11-08 16:26:57,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a13c767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:26:57, skipping insertion in model container [2024-11-08 16:26:57,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:26:57" (3/3) ... [2024-11-08 16:26:57,757 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-15.i [2024-11-08 16:26:57,779 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:26:57,779 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:26:57,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:26:57,861 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;@6a00f6e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:26:57,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:26:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:26:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:26:57,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:57,878 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:57,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:57,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash 817243291, now seen corresponding path program 1 times [2024-11-08 16:26:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:26:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033233840] [2024-11-08 16:26:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:57,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:26:57,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:26:57,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:26:57,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:26:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:58,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:26:58,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:26:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-08 16:26:58,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:26:58,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:26:58,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033233840] [2024-11-08 16:26:58,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033233840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:58,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:58,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:26:58,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233543136] [2024-11-08 16:26:58,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:58,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:26:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:26:58,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:26:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:26:58,481 INFO L87 Difference]: Start difference. First operand has 113 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:26:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:58,526 INFO L93 Difference]: Finished difference Result 219 states and 338 transitions. [2024-11-08 16:26:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:26:58,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-08 16:26:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:58,539 INFO L225 Difference]: With dead ends: 219 [2024-11-08 16:26:58,540 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 16:26:58,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:26:58,549 INFO L432 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:58,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:26:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 16:26:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 16:26:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:26:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-08 16:26:58,621 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-08 16:26:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:58,622 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-08 16:26:58,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:26:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-08 16:26:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:26:58,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:58,630 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:58,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:26:58,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:26:58,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:58,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1640835529, now seen corresponding path program 1 times [2024-11-08 16:26:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:26:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607474667] [2024-11-08 16:26:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:58,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:26:58,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:26:58,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:26:58,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:26:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:26:59,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:26:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-08 16:26:59,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:26:59,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:26:59,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607474667] [2024-11-08 16:26:59,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607474667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:59,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:59,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:26:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540292925] [2024-11-08 16:26:59,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:59,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:26:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:26:59,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:26:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:26:59,306 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:26:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:59,449 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-08 16:26:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:26:59,454 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-08 16:26:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:59,457 INFO L225 Difference]: With dead ends: 217 [2024-11-08 16:26:59,457 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:26:59,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:26:59,462 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:59,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:26:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:26:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-08 16:26:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:26:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-08 16:26:59,485 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-08 16:26:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:59,487 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-08 16:26:59,487 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:26:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-08 16:26:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:26:59,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:59,491 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:59,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:26:59,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:26:59,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:59,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:59,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1196934855, now seen corresponding path program 1 times [2024-11-08 16:26:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:26:59,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307938044] [2024-11-08 16:26:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:59,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:26:59,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:26:59,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:26:59,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:27:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:00,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:27:00,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:27:00,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:27:00,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:00,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307938044] [2024-11-08 16:27:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307938044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:00,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:00,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:27:00,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674050511] [2024-11-08 16:27:00,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:00,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:27:00,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:00,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:27:00,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:27:00,214 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:27:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:05,486 INFO L93 Difference]: Finished difference Result 230 states and 333 transitions. [2024-11-08 16:27:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:27:05,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 16:27:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:05,490 INFO L225 Difference]: With dead ends: 230 [2024-11-08 16:27:05,490 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 16:27:05,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 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 16:27:05,492 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:05,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 451 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-08 16:27:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 16:27:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2024-11-08 16:27:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-08 16:27:05,505 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-11-08 16:27:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:05,506 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-08 16:27:05,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:27:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-08 16:27:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:27:05,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:05,509 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:05,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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 16:27:05,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:05,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:05,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:05,714 INFO L85 PathProgramCache]: Analyzing trace with hash -492008887, now seen corresponding path program 1 times [2024-11-08 16:27:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:27:05,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9485237] [2024-11-08 16:27:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:05,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:05,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:27:05,719 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:27:05,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:27:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:06,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:27:06,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:06,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-08 16:27:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:27:06,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:27:06,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:06,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9485237] [2024-11-08 16:27:06,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9485237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:06,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:06,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:27:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256659633] [2024-11-08 16:27:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:06,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:27:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:06,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:27:06,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:27:06,143 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:27:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:06,188 INFO L93 Difference]: Finished difference Result 221 states and 316 transitions. [2024-11-08 16:27:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:27:06,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 16:27:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:06,190 INFO L225 Difference]: With dead ends: 221 [2024-11-08 16:27:06,190 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:27:06,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:27:06,192 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:06,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:27:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:27:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-08 16:27:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-11-08 16:27:06,215 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 115 [2024-11-08 16:27:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:06,216 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-11-08 16:27:06,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:27:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-11-08 16:27:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:27:06,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:06,218 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:06,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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 16:27:06,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:06,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:06,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash -620172654, now seen corresponding path program 1 times [2024-11-08 16:27:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:27:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232506866] [2024-11-08 16:27:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:06,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:06,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:27:06,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:27:06,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:27:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:06,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:27:06,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:27:06,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:27:06,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:06,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232506866] [2024-11-08 16:27:06,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232506866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:06,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:06,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:27:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304938887] [2024-11-08 16:27:06,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:06,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:27:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:27:06,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:27:06,965 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:27:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:06,993 INFO L93 Difference]: Finished difference Result 220 states and 313 transitions. [2024-11-08 16:27:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:27:06,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-08 16:27:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:06,995 INFO L225 Difference]: With dead ends: 220 [2024-11-08 16:27:06,995 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 16:27:06,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:27:06,997 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:06,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:27:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 16:27:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 16:27:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-08 16:27:07,017 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 115 [2024-11-08 16:27:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:07,018 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-08 16:27:07,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:27:07,018 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-08 16:27:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:27:07,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:07,021 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:07,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:27:07,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:07,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:07,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash -362007216, now seen corresponding path program 1 times [2024-11-08 16:27:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:27:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544610016] [2024-11-08 16:27:07,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:07,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:07,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:27:07,230 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:27:07,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:27:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:07,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:27:07,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:08,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:27:08,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:27:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-08 16:27:08,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:27:08,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:08,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544610016] [2024-11-08 16:27:08,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544610016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:08,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:08,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:27:08,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111306439] [2024-11-08 16:27:08,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:08,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:27:08,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:08,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:27:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:27:08,386 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:27:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:11,984 INFO L93 Difference]: Finished difference Result 222 states and 314 transitions. [2024-11-08 16:27:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:27:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-08 16:27:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:11,991 INFO L225 Difference]: With dead ends: 222 [2024-11-08 16:27:11,991 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 16:27:11,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:27:11,993 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 121 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:11,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 16:27:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 16:27:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-08 16:27:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-08 16:27:12,002 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 115 [2024-11-08 16:27:12,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:12,003 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-08 16:27:12,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:27:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-08 16:27:12,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 16:27:12,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:12,006 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:12,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:27:12,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:12,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:12,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1513439318, now seen corresponding path program 1 times [2024-11-08 16:27:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:27:12,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061170919] [2024-11-08 16:27:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:12,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:27:12,210 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:27:12,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 16:27:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:12,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:27:12,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:13,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:27:13,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:27:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-11-08 16:27:13,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:27:13,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061170919] [2024-11-08 16:27:13,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061170919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:13,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:13,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:27:13,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706061806] [2024-11-08 16:27:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:13,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:27:13,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:13,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:27:13,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:27:13,362 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:27:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:17,314 INFO L93 Difference]: Finished difference Result 221 states and 311 transitions. [2024-11-08 16:27:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:27:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-08 16:27:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:17,323 INFO L225 Difference]: With dead ends: 221 [2024-11-08 16:27:17,323 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 16:27:17,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:27:17,325 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 112 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:17,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 427 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 16:27:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 16:27:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-11-08 16:27:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2024-11-08 16:27:17,335 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 117 [2024-11-08 16:27:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:17,336 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2024-11-08 16:27:17,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:27:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2024-11-08 16:27:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:27:17,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:17,342 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:17,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:27:17,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:17,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:17,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2031975662, now seen corresponding path program 1 times [2024-11-08 16:27:17,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:27:17,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894981385] [2024-11-08 16:27:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:17,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:17,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:27:17,546 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:27:17,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 16:27:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:18,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 16:27:18,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:18,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:27:18,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-11-08 16:27:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-08 16:27:18,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:27:19,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:27:19,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-11-08 16:27:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 16:27:19,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:19,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894981385] [2024-11-08 16:27:19,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894981385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:27:19,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:27:19,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-08 16:27:19,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773069491] [2024-11-08 16:27:19,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:27:19,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:27:19,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:27:19,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:27:19,246 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-08 16:27:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:23,833 INFO L93 Difference]: Finished difference Result 230 states and 320 transitions. [2024-11-08 16:27:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:27:23,838 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 119 [2024-11-08 16:27:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:23,839 INFO L225 Difference]: With dead ends: 230 [2024-11-08 16:27:23,839 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 16:27:23,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:27:23,840 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 130 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:23,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 589 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 16:27:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 16:27:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2024-11-08 16:27:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2024-11-08 16:27:23,849 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 119 [2024-11-08 16:27:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:23,849 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2024-11-08 16:27:23,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-08 16:27:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-11-08 16:27:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:27:23,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:23,852 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:23,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 16:27:24,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:24,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:24,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:24,053 INFO L85 PathProgramCache]: Analyzing trace with hash 876206224, now seen corresponding path program 1 times [2024-11-08 16:27:24,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:27:24,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7748373] [2024-11-08 16:27:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:24,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:24,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:27:24,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:27:24,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 16:27:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:24,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:27:24,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:25,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:27:25,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:27:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 16:27:25,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:27:25,089 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7748373] [2024-11-08 16:27:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7748373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:27:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713192542] [2024-11-08 16:27:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:25,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:27:25,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:25,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:27:25,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:27:25,095 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:27:27,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:27:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:29,296 INFO L93 Difference]: Finished difference Result 218 states and 302 transitions. [2024-11-08 16:27:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:27:29,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-11-08 16:27:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:29,303 INFO L225 Difference]: With dead ends: 218 [2024-11-08 16:27:29,303 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:27:29,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:27:29,304 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 101 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:29,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 415 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 16:27:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:27:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 16:27:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2024-11-08 16:27:29,312 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 119 [2024-11-08 16:27:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:29,312 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2024-11-08 16:27:29,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:27:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2024-11-08 16:27:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 16:27:29,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:29,315 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:29,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-08 16:27:29,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:29,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:29,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1249192170, now seen corresponding path program 1 times [2024-11-08 16:27:29,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:27:29,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389161088] [2024-11-08 16:27:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:29,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:29,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:27:29,520 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:27:29,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-08 16:27:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:30,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:27:30,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:30,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:27:30,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-08 16:27:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 16:27:30,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:27:30,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:30,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389161088] [2024-11-08 16:27:30,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389161088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:30,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:30,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:27:30,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272338236] [2024-11-08 16:27:30,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:30,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:27:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:27:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:27:30,612 INFO L87 Difference]: Start difference. First operand 110 states and 151 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:27:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:33,679 INFO L93 Difference]: Finished difference Result 218 states and 300 transitions. [2024-11-08 16:27:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:27:33,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-08 16:27:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:33,686 INFO L225 Difference]: With dead ends: 218 [2024-11-08 16:27:33,686 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:27:33,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:27:33,687 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 92 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:33,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 408 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 16:27:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:27:33,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 16:27:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2024-11-08 16:27:33,694 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 121 [2024-11-08 16:27:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:33,695 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2024-11-08 16:27:33,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 16:27:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2024-11-08 16:27:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 16:27:33,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:33,698 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:33,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-08 16:27:33,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:33,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:33,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash -428495920, now seen corresponding path program 1 times [2024-11-08 16:27:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:27:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026396190] [2024-11-08 16:27:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:33,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:27:33,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:27:33,902 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:27:33,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-08 16:27:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:34,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:27:34,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:34,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 16:27:35,393 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 16:27:36,102 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 16:27:36,798 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 16:27:37,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-11-08 16:27:37,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 40 [2024-11-08 16:27:42,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2024-11-08 16:27:43,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2024-11-08 16:27:52,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:27:52,577 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 15 case distinctions, treesize of input 74 treesize of output 73 [2024-11-08 16:27:52,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:27:52,817 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 67 treesize of output 35 [2024-11-08 16:27:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 104 proven. 71 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-08 16:27:52,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:27:53,381 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:27:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026396190] [2024-11-08 16:27:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026396190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:27:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400518456] [2024-11-08 16:27:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:53,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:27:53,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:27:53,384 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:27:53,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 16:27:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:53,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 16:27:53,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:55,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:27:55,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-08 16:27:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 16:27:56,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:27:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400518456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:27:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2024-11-08 16:27:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075788483] [2024-11-08 16:27:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:56,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:27:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:27:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:27:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=404, Unknown=3, NotChecked=0, Total=506 [2024-11-08 16:27:56,347 INFO L87 Difference]: Start difference. First operand 110 states and 150 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:27:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:59,772 INFO L93 Difference]: Finished difference Result 223 states and 305 transitions. [2024-11-08 16:27:59,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:27:59,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-08 16:27:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:59,774 INFO L225 Difference]: With dead ends: 223 [2024-11-08 16:27:59,774 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 16:27:59,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=109, Invalid=440, Unknown=3, NotChecked=0, Total=552 [2024-11-08 16:27:59,775 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 87 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:59,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 395 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 16:27:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 16:27:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-08 16:27:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 16:27:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2024-11-08 16:27:59,783 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 123 [2024-11-08 16:27:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:59,784 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2024-11-08 16:27:59,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 16:27:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2024-11-08 16:27:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 16:27:59,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:59,786 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:59,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-08 16:28:00,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 16:28:00,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:28:00,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:00,187 INFO L85 PathProgramCache]: Analyzing trace with hash 66374137, now seen corresponding path program 1 times [2024-11-08 16:28:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:28:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654467468] [2024-11-08 16:28:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:28:00,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:28:00,189 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:28:00,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-08 16:28:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:00,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 16:28:00,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:28:00,975 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 97 treesize of output 96 [2024-11-08 16:28:01,328 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 152 treesize of output 132 [2024-11-08 16:28:02,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 16:28:02,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-08 16:28:07,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2024-11-08 16:28:15,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 39 [2024-11-08 16:28:16,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:28:16,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 57 [2024-11-08 16:28:29,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:28:29,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 23 [2024-11-08 16:28:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 53 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-08 16:28:29,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:28:33,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:28:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654467468] [2024-11-08 16:28:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654467468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:28:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690573611] [2024-11-08 16:28:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:28:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:28:33,485 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:28:33,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5dc12be2-2c35-486c-9dd1-962801af3c3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 16:28:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:33,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 16:28:33,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:28:33,863 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 98 treesize of output 97 [2024-11-08 16:28:42,515 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 147 treesize of output 129 [2024-11-08 16:28:43,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 16:28:43,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2024-11-08 16:28:43,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-08 16:29:04,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2024-11-08 16:29:33,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:29:33,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 47 [2024-11-08 16:30:02,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:30:02,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 19 [2024-11-08 16:30:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 120 proven. 53 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 16:30:02,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:30:10,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690573611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:30:10,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:30:10,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2024-11-08 16:30:10,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372656677] [2024-11-08 16:30:10,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:30:10,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:30:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:30:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:30:10,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=279, Unknown=30, NotChecked=0, Total=380 [2024-11-08 16:30:10,706 INFO L87 Difference]: Start difference. First operand 112 states and 152 transitions. Second operand has 16 states, 15 states have (on average 8.066666666666666) internal successors, (121), 15 states have internal predecessors, (121), 9 states have call successors, (16), 8 states have call predecessors, (16), 9 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2024-11-08 16:30:12,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:30:15,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 16:30:22,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:30:23,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:30:27,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:30:41,610 WARN L286 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 145 DAG size of output: 143 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:30:45,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:30:59,506 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 147 DAG size of output: 145 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:31:03,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:31:07,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:31:10,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:31:15,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:31:17,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:31:51,834 WARN L286 SmtUtils]: Spent 10.52s on a formula simplification. DAG size of input: 169 DAG size of output: 167 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:31:54,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:31:55,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:00,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:03,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:15,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:17,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:22,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:33,636 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:32:39,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:43,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:47,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:51,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:55,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:32:59,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:33:31,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:33:35,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:33:39,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:33:43,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:33:47,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:33:51,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:33:55,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:33:59,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:03,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:07,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:11,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:15,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:19,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:23,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:27,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:31,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:35,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:39,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:43,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:47,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:51,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:55,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:34:59,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:03,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:07,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:11,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:15,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:19,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:23,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:27,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:31,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:35,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:39,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:43,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:47,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:51,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:55,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:35:59,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:03,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:07,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:11,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:15,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:19,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:23,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:27,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:31,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:35,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:39,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:43,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:47,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:37:20,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:37:24,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:37:28,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:37:32,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:37:36,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:08,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:12,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:16,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:20,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:24,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:28,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:32,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:36,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:40,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:44,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:48,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:52,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:38:56,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:39:00,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:39:04,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:39:08,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:39:12,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]