./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:56:14,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:56:14,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:56:14,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:56:14,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:56:14,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:56:14,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:56:14,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:56:14,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:56:14,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:56:14,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:56:14,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:56:14,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:56:14,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:56:14,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:56:14,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:56:14,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:56:14,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:56:14,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:56:14,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:56:14,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:56:14,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:56:14,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:56:14,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:56:14,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:56:14,654 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:56:14,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:56:14,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:56:14,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:56:14,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:56:14,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:56:14,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:56:14,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:56:14,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:56:14,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:56:14,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:56:14,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:56:14,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:56:14,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:56:14,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:56:14,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:56:14,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:56:14,659 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2024-11-10 09:56:14,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:56:14,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:56:14,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:56:14,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:56:14,979 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:56:14,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-10 09:56:16,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:56:16,594 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:56:16,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-10 09:56:16,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45a1d78c/12a450b97a404572b7e93fcabe347834/FLAG28cba8a46 [2024-11-10 09:56:16,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45a1d78c/12a450b97a404572b7e93fcabe347834 [2024-11-10 09:56:16,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:56:16,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:56:16,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:56:16,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:56:16,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:56:16,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:56:16" (1/1) ... [2024-11-10 09:56:16,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b1d04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:16, skipping insertion in model container [2024-11-10 09:56:16,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:56:16" (1/1) ... [2024-11-10 09:56:16,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:56:16,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-10 09:56:16,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:56:16,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:56:16,989 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-10 09:56:17,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:56:17,073 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:56:17,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17 WrapperNode [2024-11-10 09:56:17,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:56:17,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:56:17,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:56:17,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:56:17,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,149 INFO L138 Inliner]: procedures = 30, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 640 [2024-11-10 09:56:17,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:56:17,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:56:17,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:56:17,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:56:17,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,185 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:56:17,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,212 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:56:17,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:56:17,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:56:17,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:56:17,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (1/1) ... [2024-11-10 09:56:17,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:56:17,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:56:17,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:56:17,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:56:17,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:56:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:56:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:56:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:56:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:56:17,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:56:17,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:56:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:56:17,326 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:56:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:56:17,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:56:17,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:56:17,511 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:56:17,512 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:56:18,080 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~ite115#1;havoc property_#t~ite114#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short112#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~ite123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite140#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~ite179#1;havoc property_#t~mem176#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite151#1;havoc property_#t~mem150#1;havoc property_#t~ite158#1;havoc property_#t~mem152#1;havoc property_#t~ite154#1;havoc property_#t~mem153#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~ite175#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite163#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite167#1;havoc property_#t~mem166#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~ite170#1;havoc property_#t~mem169#1;havoc property_#t~mem171#1;havoc property_#t~ite173#1;havoc property_#t~mem172#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~short180#1; [2024-11-10 09:56:18,132 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2024-11-10 09:56:18,133 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:56:18,148 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:56:18,149 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:56:18,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:56:18 BoogieIcfgContainer [2024-11-10 09:56:18,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:56:18,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:56:18,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:56:18,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:56:18,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:56:16" (1/3) ... [2024-11-10 09:56:18,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298a2ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:56:18, skipping insertion in model container [2024-11-10 09:56:18,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:56:17" (2/3) ... [2024-11-10 09:56:18,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298a2ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:56:18, skipping insertion in model container [2024-11-10 09:56:18,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:56:18" (3/3) ... [2024-11-10 09:56:18,160 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-10 09:56:18,175 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:56:18,175 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:56:18,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:56:18,251 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;@74b03e1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:56:18,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:56:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 134 states have internal predecessors, (193), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:56:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:56:18,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:18,272 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:18,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:18,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:18,280 INFO L85 PathProgramCache]: Analyzing trace with hash 322100534, now seen corresponding path program 1 times [2024-11-10 09:56:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788384183] [2024-11-10 09:56:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:18,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788384183] [2024-11-10 09:56:18,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788384183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:18,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:18,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:56:18,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911155422] [2024-11-10 09:56:18,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:56:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:18,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:56:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:56:18,876 INFO L87 Difference]: Start difference. First operand has 152 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 134 states have internal predecessors, (193), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:18,910 INFO L93 Difference]: Finished difference Result 296 states and 459 transitions. [2024-11-10 09:56:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:56:18,913 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-10 09:56:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:18,924 INFO L225 Difference]: With dead ends: 296 [2024-11-10 09:56:18,924 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 09:56:18,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-10 09:56:18,933 INFO L432 NwaCegarLoop]: 217 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, 217 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-10 09:56:18,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:56:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 09:56:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-10 09:56:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:56:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-10 09:56:18,998 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 135 [2024-11-10 09:56:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:18,999 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-10 09:56:18,999 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-10 09:56:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:56:19,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:19,003 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:19,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:56:19,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:19,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -648100862, now seen corresponding path program 1 times [2024-11-10 09:56:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:19,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650301892] [2024-11-10 09:56:19,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650301892] [2024-11-10 09:56:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650301892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:56:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267528933] [2024-11-10 09:56:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:19,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:56:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:56:19,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:56:19,493 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:19,558 INFO L93 Difference]: Finished difference Result 293 states and 434 transitions. [2024-11-10 09:56:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:56:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-10 09:56:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:19,561 INFO L225 Difference]: With dead ends: 293 [2024-11-10 09:56:19,561 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 09:56:19,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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-10 09:56:19,566 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:19,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 634 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:56:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 09:56:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-10 09:56:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:56:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-11-10 09:56:19,593 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 135 [2024-11-10 09:56:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:19,598 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-11-10 09:56:19,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-11-10 09:56:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 09:56:19,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:19,603 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:19,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:56:19,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1968434108, now seen corresponding path program 1 times [2024-11-10 09:56:19,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:19,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042581756] [2024-11-10 09:56:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:21,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042581756] [2024-11-10 09:56:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042581756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:21,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:21,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:56:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856384886] [2024-11-10 09:56:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:21,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:56:21,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:56:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:56:21,550 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:21,820 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2024-11-10 09:56:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:56:21,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2024-11-10 09:56:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:21,823 INFO L225 Difference]: With dead ends: 368 [2024-11-10 09:56:21,824 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 09:56:21,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-10 09:56:21,826 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 61 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:21,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 663 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:56:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 09:56:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2024-11-10 09:56:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 180 states have (on average 1.3944444444444444) internal successors, (251), 180 states have internal predecessors, (251), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:56:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 315 transitions. [2024-11-10 09:56:21,863 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 315 transitions. Word has length 137 [2024-11-10 09:56:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:21,864 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 315 transitions. [2024-11-10 09:56:21,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 315 transitions. [2024-11-10 09:56:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 09:56:21,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:21,870 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:21,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:56:21,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:21,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -623188429, now seen corresponding path program 1 times [2024-11-10 09:56:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:21,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984270234] [2024-11-10 09:56:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 09:56:23,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:23,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984270234] [2024-11-10 09:56:23,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984270234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:56:23,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805924478] [2024-11-10 09:56:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:23,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:56:23,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:56:23,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:56:23,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 09:56:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:23,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 09:56:23,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:56:26,860 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-10 09:56:26,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:26,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:26,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:26,959 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 21 treesize of output 24 [2024-11-10 09:56:27,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:27,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:27,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:27,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:27,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:27,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 09:56:27,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2024-11-10 09:56:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:27,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:56:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805924478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 09:56:27,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2024-11-10 09:56:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180432650] [2024-11-10 09:56:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:27,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 09:56:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 09:56:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-10 09:56:27,314 INFO L87 Difference]: Start difference. First operand 215 states and 315 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:28,063 INFO L93 Difference]: Finished difference Result 440 states and 646 transitions. [2024-11-10 09:56:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:56:28,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-10 09:56:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:28,067 INFO L225 Difference]: With dead ends: 440 [2024-11-10 09:56:28,067 INFO L226 Difference]: Without dead ends: 294 [2024-11-10 09:56:28,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2024-11-10 09:56:28,068 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 610 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:28,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1139 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:56:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-10 09:56:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 250. [2024-11-10 09:56:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 215 states have (on average 1.4093023255813955) internal successors, (303), 215 states have internal predecessors, (303), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:56:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 367 transitions. [2024-11-10 09:56:28,091 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 367 transitions. Word has length 138 [2024-11-10 09:56:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:28,091 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 367 transitions. [2024-11-10 09:56:28,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 367 transitions. [2024-11-10 09:56:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 09:56:28,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:28,093 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:28,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 09:56:28,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:56:28,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:28,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash 723698197, now seen corresponding path program 1 times [2024-11-10 09:56:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764470792] [2024-11-10 09:56:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:28,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:28,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764470792] [2024-11-10 09:56:28,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764470792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:28,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:56:28,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410750960] [2024-11-10 09:56:28,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:28,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:56:28,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:28,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:56:28,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:56:28,419 INFO L87 Difference]: Start difference. First operand 250 states and 367 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:28,456 INFO L93 Difference]: Finished difference Result 544 states and 802 transitions. [2024-11-10 09:56:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:56:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-10 09:56:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:28,460 INFO L225 Difference]: With dead ends: 544 [2024-11-10 09:56:28,460 INFO L226 Difference]: Without dead ends: 363 [2024-11-10 09:56:28,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10 09:56:28,464 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 115 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:28,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 460 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:56:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-10 09:56:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 309. [2024-11-10 09:56:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 274 states have (on average 1.4306569343065694) internal successors, (392), 274 states have internal predecessors, (392), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:56:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 456 transitions. [2024-11-10 09:56:28,490 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 456 transitions. Word has length 138 [2024-11-10 09:56:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:28,490 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 456 transitions. [2024-11-10 09:56:28,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 456 transitions. [2024-11-10 09:56:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:56:28,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:28,492 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:28,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:56:28,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:28,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1335503952, now seen corresponding path program 1 times [2024-11-10 09:56:28,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:28,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249518912] [2024-11-10 09:56:28,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249518912] [2024-11-10 09:56:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249518912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:28,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:28,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:56:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504889924] [2024-11-10 09:56:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:28,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:56:28,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:56:28,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:56:28,710 INFO L87 Difference]: Start difference. First operand 309 states and 456 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:28,755 INFO L93 Difference]: Finished difference Result 551 states and 816 transitions. [2024-11-10 09:56:28,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:56:28,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-11-10 09:56:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:28,757 INFO L225 Difference]: With dead ends: 551 [2024-11-10 09:56:28,758 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 09:56:28,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-10 09:56:28,759 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:28,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 841 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:56:28,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 09:56:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2024-11-10 09:56:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 276 states have (on average 1.4275362318840579) internal successors, (394), 276 states have internal predecessors, (394), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 09:56:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 458 transitions. [2024-11-10 09:56:28,783 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 458 transitions. Word has length 139 [2024-11-10 09:56:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:28,784 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 458 transitions. [2024-11-10 09:56:28,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 458 transitions. [2024-11-10 09:56:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-10 09:56:28,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:28,786 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:28,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:56:28,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:28,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1554309919, now seen corresponding path program 1 times [2024-11-10 09:56:28,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:28,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759163244] [2024-11-10 09:56:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:28,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:30,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:30,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759163244] [2024-11-10 09:56:30,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759163244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:30,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:56:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482101996] [2024-11-10 09:56:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:30,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:56:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:30,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:56:30,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:56:30,377 INFO L87 Difference]: Start difference. First operand 311 states and 458 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:30,659 INFO L93 Difference]: Finished difference Result 784 states and 1163 transitions. [2024-11-10 09:56:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:56:30,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-11-10 09:56:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:30,663 INFO L225 Difference]: With dead ends: 784 [2024-11-10 09:56:30,664 INFO L226 Difference]: Without dead ends: 546 [2024-11-10 09:56:30,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:56:30,665 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 299 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:30,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 841 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:56:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-10 09:56:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 479. [2024-11-10 09:56:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 427 states have (on average 1.4332552693208431) internal successors, (612), 427 states have internal predecessors, (612), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:56:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 708 transitions. [2024-11-10 09:56:30,705 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 708 transitions. Word has length 139 [2024-11-10 09:56:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:30,706 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 708 transitions. [2024-11-10 09:56:30,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 708 transitions. [2024-11-10 09:56:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 09:56:30,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:30,708 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:30,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:56:30,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1394298108, now seen corresponding path program 1 times [2024-11-10 09:56:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249561999] [2024-11-10 09:56:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:30,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:30,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249561999] [2024-11-10 09:56:30,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249561999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:30,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:30,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 09:56:30,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207190662] [2024-11-10 09:56:30,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:30,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 09:56:30,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 09:56:30,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:56:30,955 INFO L87 Difference]: Start difference. First operand 479 states and 708 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:30,999 INFO L93 Difference]: Finished difference Result 891 states and 1320 transitions. [2024-11-10 09:56:31,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 09:56:31,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-10 09:56:31,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:31,003 INFO L225 Difference]: With dead ends: 891 [2024-11-10 09:56:31,003 INFO L226 Difference]: Without dead ends: 485 [2024-11-10 09:56:31,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-10 09:56:31,004 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 840 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-10 09:56:31,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:56:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-10 09:56:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2024-11-10 09:56:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 433 states have (on average 1.4272517321016167) internal successors, (618), 433 states have internal predecessors, (618), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:56:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 714 transitions. [2024-11-10 09:56:31,033 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 714 transitions. Word has length 140 [2024-11-10 09:56:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:31,034 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 714 transitions. [2024-11-10 09:56:31,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 714 transitions. [2024-11-10 09:56:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 09:56:31,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:31,036 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:31,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:56:31,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:31,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1956654986, now seen corresponding path program 1 times [2024-11-10 09:56:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652133192] [2024-11-10 09:56:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:31,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:32,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:32,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:32,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:32,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:32,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:32,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652133192] [2024-11-10 09:56:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652133192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:32,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:32,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:56:32,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314213991] [2024-11-10 09:56:32,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:32,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:56:32,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:56:32,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:56:32,056 INFO L87 Difference]: Start difference. First operand 485 states and 714 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:32,701 INFO L93 Difference]: Finished difference Result 940 states and 1382 transitions. [2024-11-10 09:56:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:56:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-11-10 09:56:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:32,706 INFO L225 Difference]: With dead ends: 940 [2024-11-10 09:56:32,707 INFO L226 Difference]: Without dead ends: 699 [2024-11-10 09:56:32,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-10 09:56:32,709 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 612 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:32,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 944 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:56:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-10 09:56:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 545. [2024-11-10 09:56:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 493 states have (on average 1.436105476673428) internal successors, (708), 493 states have internal predecessors, (708), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:56:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 804 transitions. [2024-11-10 09:56:32,745 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 804 transitions. Word has length 140 [2024-11-10 09:56:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:32,746 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 804 transitions. [2024-11-10 09:56:32,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 804 transitions. [2024-11-10 09:56:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-10 09:56:32,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:32,747 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 09:56:32,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:32,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1558368496, now seen corresponding path program 1 times [2024-11-10 09:56:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799874857] [2024-11-10 09:56:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:33,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:33,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799874857] [2024-11-10 09:56:33,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799874857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:33,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:33,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:56:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353911684] [2024-11-10 09:56:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:33,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:56:33,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:33,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:56:33,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:56:33,490 INFO L87 Difference]: Start difference. First operand 545 states and 804 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:33,959 INFO L93 Difference]: Finished difference Result 1000 states and 1471 transitions. [2024-11-10 09:56:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:56:33,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140 [2024-11-10 09:56:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:33,963 INFO L225 Difference]: With dead ends: 1000 [2024-11-10 09:56:33,963 INFO L226 Difference]: Without dead ends: 699 [2024-11-10 09:56:33,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:56:33,965 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 475 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:33,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1078 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:56:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-10 09:56:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 605. [2024-11-10 09:56:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 553 states have (on average 1.4430379746835442) internal successors, (798), 553 states have internal predecessors, (798), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:56:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 894 transitions. [2024-11-10 09:56:34,021 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 894 transitions. Word has length 140 [2024-11-10 09:56:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:34,022 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 894 transitions. [2024-11-10 09:56:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 894 transitions. [2024-11-10 09:56:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:56:34,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:34,024 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:34,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 09:56:34,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:34,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash -630451794, now seen corresponding path program 1 times [2024-11-10 09:56:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814054965] [2024-11-10 09:56:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:34,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:34,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814054965] [2024-11-10 09:56:34,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814054965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:34,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:34,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 09:56:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838591064] [2024-11-10 09:56:34,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:34,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 09:56:34,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:34,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 09:56:34,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 09:56:34,175 INFO L87 Difference]: Start difference. First operand 605 states and 894 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:34,269 INFO L93 Difference]: Finished difference Result 1217 states and 1792 transitions. [2024-11-10 09:56:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 09:56:34,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2024-11-10 09:56:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:34,275 INFO L225 Difference]: With dead ends: 1217 [2024-11-10 09:56:34,276 INFO L226 Difference]: Without dead ends: 685 [2024-11-10 09:56:34,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10 09:56:34,278 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 106 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:34,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 516 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:56:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-10 09:56:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 578. [2024-11-10 09:56:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 526 states have (on average 1.420152091254753) internal successors, (747), 526 states have internal predecessors, (747), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:56:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 843 transitions. [2024-11-10 09:56:34,312 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 843 transitions. Word has length 141 [2024-11-10 09:56:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:34,313 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 843 transitions. [2024-11-10 09:56:34,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:56:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 843 transitions. [2024-11-10 09:56:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:56:34,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:34,317 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:34,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 09:56:34,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:34,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:34,317 INFO L85 PathProgramCache]: Analyzing trace with hash 883757988, now seen corresponding path program 1 times [2024-11-10 09:56:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997917792] [2024-11-10 09:56:34,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:34,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:37,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997917792] [2024-11-10 09:56:37,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997917792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:37,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 09:56:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511150092] [2024-11-10 09:56:37,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:37,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 09:56:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 09:56:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:56:37,475 INFO L87 Difference]: Start difference. First operand 578 states and 843 transitions. Second operand has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:56:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:39,252 INFO L93 Difference]: Finished difference Result 1341 states and 1953 transitions. [2024-11-10 09:56:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:56:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) Word has length 141 [2024-11-10 09:56:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:39,259 INFO L225 Difference]: With dead ends: 1341 [2024-11-10 09:56:39,259 INFO L226 Difference]: Without dead ends: 836 [2024-11-10 09:56:39,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-11-10 09:56:39,261 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 430 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:39,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 2272 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 09:56:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-10 09:56:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 744. [2024-11-10 09:56:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 692 states have (on average 1.4277456647398843) internal successors, (988), 692 states have internal predecessors, (988), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 09:56:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1084 transitions. [2024-11-10 09:56:39,317 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1084 transitions. Word has length 141 [2024-11-10 09:56:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:39,317 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1084 transitions. [2024-11-10 09:56:39,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:56:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1084 transitions. [2024-11-10 09:56:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:56:39,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:39,319 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:39,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 09:56:39,320 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1012840707, now seen corresponding path program 1 times [2024-11-10 09:56:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780369954] [2024-11-10 09:56:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:40,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:40,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780369954] [2024-11-10 09:56:40,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780369954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:40,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:40,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:56:40,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980887180] [2024-11-10 09:56:40,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:40,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:56:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:56:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:56:40,209 INFO L87 Difference]: Start difference. First operand 744 states and 1084 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:40,750 INFO L93 Difference]: Finished difference Result 1546 states and 2243 transitions. [2024-11-10 09:56:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:56:40,750 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), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-10 09:56:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:40,754 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 09:56:40,754 INFO L226 Difference]: Without dead ends: 875 [2024-11-10 09:56:40,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 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-10 09:56:40,756 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 279 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:40,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 916 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 09:56:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-11-10 09:56:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 870. [2024-11-10 09:56:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 799 states have (on average 1.411764705882353) internal successors, (1128), 801 states have internal predecessors, (1128), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:56:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1256 transitions. [2024-11-10 09:56:40,826 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1256 transitions. Word has length 141 [2024-11-10 09:56:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:40,826 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1256 transitions. [2024-11-10 09:56:40,827 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), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1256 transitions. [2024-11-10 09:56:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:56:40,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:40,828 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:40,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 09:56:40,829 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:40,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1095108901, now seen corresponding path program 1 times [2024-11-10 09:56:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051474186] [2024-11-10 09:56:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:41,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051474186] [2024-11-10 09:56:41,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051474186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:41,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:56:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558991311] [2024-11-10 09:56:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:41,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:56:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:41,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:56:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:56:41,707 INFO L87 Difference]: Start difference. First operand 870 states and 1256 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:42,419 INFO L93 Difference]: Finished difference Result 1845 states and 2663 transitions. [2024-11-10 09:56:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:56:42,420 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), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2024-11-10 09:56:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:42,427 INFO L225 Difference]: With dead ends: 1845 [2024-11-10 09:56:42,427 INFO L226 Difference]: Without dead ends: 1052 [2024-11-10 09:56:42,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 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-10 09:56:42,435 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 280 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:42,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 941 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 09:56:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-10 09:56:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 928. [2024-11-10 09:56:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 857 states have (on average 1.413068844807468) internal successors, (1211), 859 states have internal predecessors, (1211), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:56:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1339 transitions. [2024-11-10 09:56:42,512 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1339 transitions. Word has length 141 [2024-11-10 09:56:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:42,512 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1339 transitions. [2024-11-10 09:56:42,512 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), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1339 transitions. [2024-11-10 09:56:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-10 09:56:42,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:42,514 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:42,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 09:56:42,515 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:42,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1224191620, now seen corresponding path program 1 times [2024-11-10 09:56:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:42,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823865168] [2024-11-10 09:56:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:45,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:45,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823865168] [2024-11-10 09:56:45,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823865168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:45,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:45,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 09:56:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811567825] [2024-11-10 09:56:45,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:45,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 09:56:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:45,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 09:56:45,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:56:45,239 INFO L87 Difference]: Start difference. First operand 928 states and 1339 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-10 09:56:46,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:46,734 INFO L93 Difference]: Finished difference Result 1866 states and 2694 transitions. [2024-11-10 09:56:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:56:46,735 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 141 [2024-11-10 09:56:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:46,740 INFO L225 Difference]: With dead ends: 1866 [2024-11-10 09:56:46,740 INFO L226 Difference]: Without dead ends: 1015 [2024-11-10 09:56:46,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-11-10 09:56:46,742 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 403 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:46,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2156 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 09:56:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-10 09:56:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 923. [2024-11-10 09:56:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 852 states have (on average 1.414319248826291) internal successors, (1205), 854 states have internal predecessors, (1205), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:56:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1333 transitions. [2024-11-10 09:56:46,808 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1333 transitions. Word has length 141 [2024-11-10 09:56:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:46,808 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1333 transitions. [2024-11-10 09:56:46,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-10 09:56:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1333 transitions. [2024-11-10 09:56:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 09:56:46,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:46,811 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:46,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 09:56:46,811 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash -151667430, now seen corresponding path program 1 times [2024-11-10 09:56:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061600863] [2024-11-10 09:56:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:48,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061600863] [2024-11-10 09:56:48,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061600863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:48,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:48,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 09:56:48,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710177824] [2024-11-10 09:56:48,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:48,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 09:56:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:48,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 09:56:48,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:56:48,896 INFO L87 Difference]: Start difference. First operand 923 states and 1333 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:56:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:50,091 INFO L93 Difference]: Finished difference Result 1553 states and 2241 transitions. [2024-11-10 09:56:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 09:56:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 142 [2024-11-10 09:56:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:50,097 INFO L225 Difference]: With dead ends: 1553 [2024-11-10 09:56:50,097 INFO L226 Difference]: Without dead ends: 1041 [2024-11-10 09:56:50,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2024-11-10 09:56:50,099 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 810 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:50,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1375 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 09:56:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-10 09:56:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1028. [2024-11-10 09:56:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 954 states have (on average 1.4150943396226414) internal successors, (1350), 957 states have internal predecessors, (1350), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 09:56:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1482 transitions. [2024-11-10 09:56:50,180 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1482 transitions. Word has length 142 [2024-11-10 09:56:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:50,181 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1482 transitions. [2024-11-10 09:56:50,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-10 09:56:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1482 transitions. [2024-11-10 09:56:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-10 09:56:50,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:50,183 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:50,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 09:56:50,183 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:50,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1784918557, now seen corresponding path program 1 times [2024-11-10 09:56:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036855638] [2024-11-10 09:56:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:52,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036855638] [2024-11-10 09:56:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036855638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:52,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:52,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:56:52,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241868086] [2024-11-10 09:56:52,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:52,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:56:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:56:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:56:52,130 INFO L87 Difference]: Start difference. First operand 1028 states and 1482 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:52,859 INFO L93 Difference]: Finished difference Result 1753 states and 2522 transitions. [2024-11-10 09:56:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:56:52,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2024-11-10 09:56:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:52,865 INFO L225 Difference]: With dead ends: 1753 [2024-11-10 09:56:52,865 INFO L226 Difference]: Without dead ends: 1136 [2024-11-10 09:56:52,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:56:52,868 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 610 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:52,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 676 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:56:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-11-10 09:56:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1131. [2024-11-10 09:56:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1047 states have (on average 1.4078319006685769) internal successors, (1474), 1052 states have internal predecessors, (1474), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-10 09:56:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1622 transitions. [2024-11-10 09:56:52,977 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1622 transitions. Word has length 142 [2024-11-10 09:56:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:52,978 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1622 transitions. [2024-11-10 09:56:52,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:56:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1622 transitions. [2024-11-10 09:56:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 09:56:52,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:52,981 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:52,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 09:56:52,981 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:52,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:52,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2124246341, now seen corresponding path program 1 times [2024-11-10 09:56:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:52,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934783501] [2024-11-10 09:56:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 09:56:53,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:53,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934783501] [2024-11-10 09:56:53,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934783501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:56:53,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487259006] [2024-11-10 09:56:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:53,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 09:56:53,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:56:53,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 09:56:53,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 09:56:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:54,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-10 09:56:54,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:56:54,334 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 49 treesize of output 48 [2024-11-10 09:56:54,470 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 96 treesize of output 72 [2024-11-10 09:56:54,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 09:56:54,838 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-10 09:56:55,033 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-10 09:56:55,258 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-10 09:56:55,409 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-10 09:56:55,560 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-10 09:56:55,691 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-10 09:56:55,816 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-10 09:56:55,929 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-10 09:56:56,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2024-11-10 09:56:56,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 58 [2024-11-10 09:56:56,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2024-11-10 09:56:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 152 proven. 93 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-10 09:56:56,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 09:56:56,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487259006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 09:56:56,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 09:56:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-10 09:56:56,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849143516] [2024-11-10 09:56:56,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 09:56:56,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 09:56:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:56,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 09:56:56,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=461, Unknown=7, NotChecked=0, Total=552 [2024-11-10 09:56:56,365 INFO L87 Difference]: Start difference. First operand 1131 states and 1622 transitions. Second operand has 20 states, 18 states have (on average 6.833333333333333) internal successors, (123), 20 states have internal predecessors, (123), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-10 09:56:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:56:57,760 INFO L93 Difference]: Finished difference Result 2398 states and 3422 transitions. [2024-11-10 09:56:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 09:56:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.833333333333333) internal successors, (123), 20 states have internal predecessors, (123), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) Word has length 144 [2024-11-10 09:56:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:56:57,767 INFO L225 Difference]: With dead ends: 2398 [2024-11-10 09:56:57,767 INFO L226 Difference]: Without dead ends: 1339 [2024-11-10 09:56:57,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1535, Unknown=8, NotChecked=0, Total=1892 [2024-11-10 09:56:57,770 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 659 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:56:57,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1530 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:56:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-10 09:56:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 953. [2024-11-10 09:56:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 877 states have (on average 1.4002280501710376) internal successors, (1228), 879 states have internal predecessors, (1228), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:56:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1356 transitions. [2024-11-10 09:56:57,870 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1356 transitions. Word has length 144 [2024-11-10 09:56:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:56:57,871 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1356 transitions. [2024-11-10 09:56:57,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.833333333333333) internal successors, (123), 20 states have internal predecessors, (123), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-10 09:56:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1356 transitions. [2024-11-10 09:56:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 09:56:57,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:56:57,873 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:56:57,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 09:56:58,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 09:56:58,073 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:56:58,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:56:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1324859209, now seen corresponding path program 1 times [2024-11-10 09:56:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:56:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868958294] [2024-11-10 09:56:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:56:58,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:56:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:56:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:56:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:56:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:56:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:56:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:56:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:56:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:56:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:56:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:56:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:56:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:56:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:56:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:56:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:56:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:56:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:56:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:56:59,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:56:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868958294] [2024-11-10 09:56:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868958294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:56:59,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:56:59,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:56:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486400741] [2024-11-10 09:56:59,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:56:59,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:56:59,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:56:59,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:56:59,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:56:59,446 INFO L87 Difference]: Start difference. First operand 953 states and 1356 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:57:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:00,123 INFO L93 Difference]: Finished difference Result 1723 states and 2449 transitions. [2024-11-10 09:57:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:57:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2024-11-10 09:57:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:00,134 INFO L225 Difference]: With dead ends: 1723 [2024-11-10 09:57:00,134 INFO L226 Difference]: Without dead ends: 1188 [2024-11-10 09:57:00,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:57:00,136 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 363 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:00,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1063 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 09:57:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2024-11-10 09:57:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1065. [2024-11-10 09:57:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 989 states have (on average 1.4054600606673406) internal successors, (1390), 991 states have internal predecessors, (1390), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:57:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1518 transitions. [2024-11-10 09:57:00,236 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1518 transitions. Word has length 144 [2024-11-10 09:57:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1518 transitions. [2024-11-10 09:57:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:57:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1518 transitions. [2024-11-10 09:57:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:57:00,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:00,237 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:57:00,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 09:57:00,237 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:00,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:00,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1742616053, now seen corresponding path program 1 times [2024-11-10 09:57:00,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:00,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535963479] [2024-11-10 09:57:00,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:00,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:57:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:57:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:57:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:57:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 09:57:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:57:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:57:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:57:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:57:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:57:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:57:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:57:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-10 09:57:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 09:57:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:57:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 09:57:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:57:01,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:57:01,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535963479] [2024-11-10 09:57:01,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535963479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:01,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:01,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:57:01,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52113371] [2024-11-10 09:57:01,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:01,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:57:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:57:01,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:57:01,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:57:01,569 INFO L87 Difference]: Start difference. First operand 1065 states and 1518 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:57:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:02,024 INFO L93 Difference]: Finished difference Result 2086 states and 2974 transitions. [2024-11-10 09:57:02,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:57:02,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-10 09:57:02,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:02,029 INFO L225 Difference]: With dead ends: 2086 [2024-11-10 09:57:02,029 INFO L226 Difference]: Without dead ends: 1097 [2024-11-10 09:57:02,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:57:02,032 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 452 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:02,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 542 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:57:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-11-10 09:57:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1052. [2024-11-10 09:57:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 975 states have (on average 1.4) internal successors, (1365), 977 states have internal predecessors, (1365), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 09:57:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1493 transitions. [2024-11-10 09:57:02,138 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1493 transitions. Word has length 145 [2024-11-10 09:57:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:02,138 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1493 transitions. [2024-11-10 09:57:02,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:57:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1493 transitions. [2024-11-10 09:57:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 09:57:02,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:02,139 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:57:02,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 09:57:02,140 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:02,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:02,140 INFO L85 PathProgramCache]: Analyzing trace with hash 193969934, now seen corresponding path program 1 times [2024-11-10 09:57:02,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:57:02,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812256663] [2024-11-10 09:57:02,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:02,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:57:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:57:02,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:57:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:57:02,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:57:02,392 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:57:02,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:57:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 09:57:02,398 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] [2024-11-10 09:57:02,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:57:02,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:57:02 BoogieIcfgContainer [2024-11-10 09:57:02,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:57:02,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:57:02,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:57:02,559 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:57:02,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:56:18" (3/4) ... [2024-11-10 09:57:02,564 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:57:02,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:57:02,565 INFO L158 Benchmark]: Toolchain (without parser) took 45937.46ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 133.8MB in the beginning and 653.5MB in the end (delta: -519.6MB). Peak memory consumption was 579.4MB. Max. memory is 16.1GB. [2024-11-10 09:57:02,566 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:57:02,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.37ms. Allocated memory is still 165.7MB. Free memory was 133.8MB in the beginning and 115.1MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 09:57:02,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.35ms. Allocated memory is still 165.7MB. Free memory was 115.1MB in the beginning and 110.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:57:02,570 INFO L158 Benchmark]: Boogie Preprocessor took 77.01ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 107.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:57:02,570 INFO L158 Benchmark]: IcfgBuilder took 922.53ms. Allocated memory is still 165.7MB. Free memory was 107.8MB in the beginning and 95.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 09:57:02,571 INFO L158 Benchmark]: TraceAbstraction took 44406.15ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 95.6MB in the beginning and 653.5MB in the end (delta: -557.8MB). Peak memory consumption was 544.2MB. Max. memory is 16.1GB. [2024-11-10 09:57:02,571 INFO L158 Benchmark]: Witness Printer took 6.19ms. Allocated memory is still 1.3GB. Free memory is still 653.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:57:02,572 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.19ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.37ms. Allocated memory is still 165.7MB. Free memory was 133.8MB in the beginning and 115.1MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.35ms. Allocated memory is still 165.7MB. Free memory was 115.1MB in the beginning and 110.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.01ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 107.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 922.53ms. Allocated memory is still 165.7MB. Free memory was 107.8MB in the beginning and 95.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44406.15ms. Allocated memory was 165.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 95.6MB in the beginning and 653.5MB in the end (delta: -557.8MB). Peak memory consumption was 544.2MB. Max. memory is 16.1GB. * Witness Printer took 6.19ms. Allocated memory is still 1.3GB. Free memory is still 653.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 131, overapproximation of someUnaryDOUBLEoperation at line 51. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L55] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] signed long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] signed long int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L68] double* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L69] unsigned char last_1_WrapperStruct00_var_1_11 = 1; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=0, last_1_WrapperStruct00_var_1_11=1] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_11 [L128] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L100] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L110] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L115] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L116] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L118] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && 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:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && 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:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && 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:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L120] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L121] EXPR WrapperStruct00.var_1_14 [L121] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_14 [L121] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && 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:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && 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:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && 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:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L122] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L123] EXPR WrapperStruct00.var_1_15 [L123] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L123] EXPR WrapperStruct00.var_1_15 [L123] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L139] RET updateVariables() [L140] CALL step() [L73] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L74] COND FALSE !(! last_1_WrapperStruct00_var_1_11) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L79] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L79] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_7_Pointer)); [L80] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L80] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_10_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, stepLocal_2=-1073741823] [L81] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_2) [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911] [L88] COND FALSE !(! (*(WrapperStruct00_var_1_11_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911] [L91] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L91] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911] [L91] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L91] (*(WrapperStruct00_var_1_6_Pointer)) = (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911] [L93] COND FALSE !((*(WrapperStruct00_var_1_4_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L131] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) [L131] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L131] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L131] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L131] EXPR (! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1) [L131] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) [L131] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer)))) [L131] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L131] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131-L132] return ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, 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_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 152 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6569 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6564 mSDsluCounter, 19644 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15253 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7837 IncrementalHoareTripleChecker+Invalid, 8229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 4391 mSDtfsCounter, 7837 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1305 GetRequests, 1078 SyntacticMatches, 9 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1131occurred in iteration=17, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 1416 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 28.0s InterpolantComputationTime, 3230 NumberOfCodeBlocks, 3230 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3063 ConstructedInterpolants, 0 QuantifiedInterpolants, 35968 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1126 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 10395/10560 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-10 09:57:02,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:57:04,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:57:04,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:57:04,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:57:04,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:57:04,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:57:04,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:57:04,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:57:04,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:57:04,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:57:04,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:57:04,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:57:04,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:57:04,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:57:04,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:57:04,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:57:04,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:57:04,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:57:04,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:57:04,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:57:04,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:57:04,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:57:04,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:57:04,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:57:04,998 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:57:04,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:57:04,999 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:57:04,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:57:04,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:57:04,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:57:04,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:57:05,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:57:05,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:57:05,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:57:05,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:57:05,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:57:05,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:57:05,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:57:05,002 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:57:05,002 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:57:05,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:57:05,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:57:05,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:57:05,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:57:05,004 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2024-11-10 09:57:05,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:57:05,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:57:05,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:57:05,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:57:05,354 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:57:05,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-10 09:57:06,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:57:07,161 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:57:07,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-10 09:57:07,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7238fab4c/983d929f807740f6b0f4d6a65bc55da3/FLAG4da8ec422 [2024-11-10 09:57:07,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7238fab4c/983d929f807740f6b0f4d6a65bc55da3 [2024-11-10 09:57:07,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:57:07,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:57:07,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:57:07,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:57:07,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:57:07,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4089b6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07, skipping insertion in model container [2024-11-10 09:57:07,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:57:07,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-10 09:57:07,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:57:07,540 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:57:07,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2024-11-10 09:57:07,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:57:07,646 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:57:07,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07 WrapperNode [2024-11-10 09:57:07,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:57:07,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:57:07,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:57:07,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:57:07,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,735 INFO L138 Inliner]: procedures = 34, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 635 [2024-11-10 09:57:07,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:57:07,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:57:07,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:57:07,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:57:07,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,804 INFO L175 MemorySlicer]: Split 152 memory accesses to 2 slices as follows [2, 150]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-10 09:57:07,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:57:07,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:57:07,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:57:07,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:57:07,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (1/1) ... [2024-11-10 09:57:07,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:57:07,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:57:07,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:57:07,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:57:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:57:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:57:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:57:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-10 09:57:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-10 09:57:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:57:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:57:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:57:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:57:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:57:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:57:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:57:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:57:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-10 09:57:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-10 09:57:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-10 09:57:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-10 09:57:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:57:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:57:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:57:07,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:57:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:57:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:57:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:57:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:57:08,109 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:57:08,111 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:57:10,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~ite115#1;havoc property_#t~ite114#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short112#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~ite123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite140#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~ite179#1;havoc property_#t~mem176#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite151#1;havoc property_#t~mem150#1;havoc property_#t~ite158#1;havoc property_#t~mem152#1;havoc property_#t~ite154#1;havoc property_#t~mem153#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~ite175#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite163#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite167#1;havoc property_#t~mem166#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~ite170#1;havoc property_#t~mem169#1;havoc property_#t~mem171#1;havoc property_#t~ite173#1;havoc property_#t~mem172#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~short180#1; [2024-11-10 09:57:10,218 INFO L? ?]: Removed 192 outVars from TransFormulas that were not future-live. [2024-11-10 09:57:10,218 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:57:10,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:57:10,238 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:57:10,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:57:10 BoogieIcfgContainer [2024-11-10 09:57:10,239 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:57:10,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:57:10,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:57:10,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:57:10,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:57:07" (1/3) ... [2024-11-10 09:57:10,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd7e599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:10, skipping insertion in model container [2024-11-10 09:57:10,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:07" (2/3) ... [2024-11-10 09:57:10,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd7e599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:10, skipping insertion in model container [2024-11-10 09:57:10,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:57:10" (3/3) ... [2024-11-10 09:57:10,250 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2024-11-10 09:57:10,267 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:57:10,267 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:57:10,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:57:10,352 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;@2dcd5ff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:57:10,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:57:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 134 states have internal predecessors, (193), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:57:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:57:10,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:10,372 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:57:10,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:10,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1680000338, now seen corresponding path program 1 times [2024-11-10 09:57:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:57:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468627080] [2024-11-10 09:57:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:10,395 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-10 09:57:10,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:57:10,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:10,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:10,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:57:10,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:57:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-10 09:57:10,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:57:10,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:57:10,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468627080] [2024-11-10 09:57:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468627080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:10,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:57:10,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201398902] [2024-11-10 09:57:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:10,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:57:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:57:10,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:57:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:57:10,862 INFO L87 Difference]: Start difference. First operand has 152 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 134 states have internal predecessors, (193), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:57:10,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:10,895 INFO L93 Difference]: Finished difference Result 296 states and 459 transitions. [2024-11-10 09:57:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:57:10,897 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-10 09:57:10,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:10,905 INFO L225 Difference]: With dead ends: 296 [2024-11-10 09:57:10,905 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 09:57:10,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-10 09:57:10,911 INFO L432 NwaCegarLoop]: 217 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, 217 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-10 09:57:10,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:57:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 09:57:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-10 09:57:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:57:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-11-10 09:57:10,964 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 135 [2024-11-10 09:57:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:10,964 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-11-10 09:57:10,965 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 09:57:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-11-10 09:57:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-10 09:57:10,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:10,969 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:57:10,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:57:11,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:11,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:11,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1644765562, now seen corresponding path program 1 times [2024-11-10 09:57:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:57:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206504168] [2024-11-10 09:57:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:11,172 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-10 09:57:11,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:57:11,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:11,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:11,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 09:57:11,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:57:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 09:57:11,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:57:11,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:57:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206504168] [2024-11-10 09:57:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206504168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:57:11,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:57:11,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:57:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757621824] [2024-11-10 09:57:11,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:57:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:57:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:57:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:57:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:57:11,657 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:57:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:57:11,729 INFO L93 Difference]: Finished difference Result 293 states and 434 transitions. [2024-11-10 09:57:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:57:11,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-10 09:57:11,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:57:11,732 INFO L225 Difference]: With dead ends: 293 [2024-11-10 09:57:11,732 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 09:57:11,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 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-10 09:57:11,734 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:57:11,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 634 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:57:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 09:57:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-10 09:57:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 09:57:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-11-10 09:57:11,756 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 135 [2024-11-10 09:57:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:57:11,757 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-11-10 09:57:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 09:57:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-11-10 09:57:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-10 09:57:11,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:57:11,766 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:57:11,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:11,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:11,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:57:11,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:57:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1842023364, now seen corresponding path program 1 times [2024-11-10 09:57:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:57:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727673277] [2024-11-10 09:57:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:57:11,969 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-10 09:57:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:57:11,973 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:11,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10 09:57:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:57:12,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 09:57:12,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:57:15,653 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 21 treesize of output 24 [2024-11-10 09:57:15,783 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 37 treesize of output 35