./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:54:17,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:54:17,641 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:54:17,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:54:17,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:54:17,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:54:17,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:54:17,694 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:54:17,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:54:17,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:54:17,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:54:17,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:54:17,702 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:54:17,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:54:17,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:54:17,705 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:54:17,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:54:17,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:54:17,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:54:17,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:54:17,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:54:17,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:54:17,709 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:54:17,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:54:17,710 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:54:17,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:54:17,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:54:17,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:54:17,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:17,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:54:17,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:54:17,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:54:17,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:54:17,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:54:17,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:54:17,716 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:54:17,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:54:17,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:54:17,717 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:54:17,717 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2023-11-06 21:54:18,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:54:18,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:54:18,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:54:18,078 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:54:18,078 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:54:18,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2023-11-06 21:54:21,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:54:21,512 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:54:21,519 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2023-11-06 21:54:21,531 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/data/4239beb6f/0e38ed8bc4554bbd87c104bca8aa82f8/FLAGa4738d27b [2023-11-06 21:54:21,552 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/data/4239beb6f/0e38ed8bc4554bbd87c104bca8aa82f8 [2023-11-06 21:54:21,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:54:21,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:54:21,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:21,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:54:21,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:54:21,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:21" (1/1) ... [2023-11-06 21:54:21,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bb442e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:21, skipping insertion in model container [2023-11-06 21:54:21,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:21" (1/1) ... [2023-11-06 21:54:21,624 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:54:21,838 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i[916,929] [2023-11-06 21:54:21,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:21,920 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:54:21,934 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i[916,929] [2023-11-06 21:54:21,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:22,006 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:54:22,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22 WrapperNode [2023-11-06 21:54:22,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:22,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:22,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:54:22,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:54:22,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,106 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 375 [2023-11-06 21:54:22,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:22,107 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:54:22,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:54:22,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:54:22,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:54:22,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:54:22,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:54:22,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:54:22,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (1/1) ... [2023-11-06 21:54:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:22,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:22,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:54:22,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:54:22,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:54:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 21:54:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:54:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 21:54:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:54:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 21:54:22,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:54:22,313 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:54:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:54:22,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:54:22,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:54:22,423 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:54:22,425 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:54:22,973 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:54:22,981 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:54:22,981 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:54:22,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:22 BoogieIcfgContainer [2023-11-06 21:54:22,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:54:22,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:54:22,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:54:22,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:54:22,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:54:21" (1/3) ... [2023-11-06 21:54:22,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2154563b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:22, skipping insertion in model container [2023-11-06 21:54:22,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:22" (2/3) ... [2023-11-06 21:54:22,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2154563b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:22, skipping insertion in model container [2023-11-06 21:54:22,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:22" (3/3) ... [2023-11-06 21:54:22,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2023-11-06 21:54:23,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:54:23,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:54:23,072 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:54:23,079 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@52f51289, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:54:23,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:54:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:54:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-06 21:54:23,102 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:23,103 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:23,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:23,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 924800917, now seen corresponding path program 1 times [2023-11-06 21:54:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:23,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27101490] [2023-11-06 21:54:23,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:23,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:23,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27101490] [2023-11-06 21:54:23,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27101490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:23,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:23,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626471148] [2023-11-06 21:54:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:23,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:54:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:54:23,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:54:23,774 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:54:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:23,840 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2023-11-06 21:54:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:54:23,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2023-11-06 21:54:23,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:23,853 INFO L225 Difference]: With dead ends: 199 [2023-11-06 21:54:23,853 INFO L226 Difference]: Without dead ends: 99 [2023-11-06 21:54:23,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:54:23,861 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:23,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:54:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-06 21:54:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-06 21:54:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:54:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-11-06 21:54:23,917 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2023-11-06 21:54:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:23,917 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-11-06 21:54:23,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:54:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-11-06 21:54:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-06 21:54:23,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:23,922 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:23,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:54:23,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:23,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1032707065, now seen corresponding path program 1 times [2023-11-06 21:54:23,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:23,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812463082] [2023-11-06 21:54:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812463082] [2023-11-06 21:54:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812463082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022511920] [2023-11-06 21:54:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:24,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:24,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:24,381 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:24,438 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2023-11-06 21:54:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:54:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-06 21:54:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:24,442 INFO L225 Difference]: With dead ends: 199 [2023-11-06 21:54:24,442 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 21:54:24,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:54:24,445 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:24,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:54:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 21:54:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-11-06 21:54:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:54:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-11-06 21:54:24,463 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2023-11-06 21:54:24,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:24,465 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-11-06 21:54:24,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-11-06 21:54:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-06 21:54:24,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:24,469 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:24,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:54:24,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:24,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1034554107, now seen corresponding path program 1 times [2023-11-06 21:54:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953665629] [2023-11-06 21:54:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:24,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:24,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953665629] [2023-11-06 21:54:24,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953665629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:24,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:24,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:54:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269058097] [2023-11-06 21:54:24,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:24,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:24,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:24,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:24,981 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:25,566 INFO L93 Difference]: Finished difference Result 332 states and 471 transitions. [2023-11-06 21:54:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:25,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-06 21:54:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:25,571 INFO L225 Difference]: With dead ends: 332 [2023-11-06 21:54:25,571 INFO L226 Difference]: Without dead ends: 234 [2023-11-06 21:54:25,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:25,575 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 316 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:25,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 407 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:54:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-11-06 21:54:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 199. [2023-11-06 21:54:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 156 states have (on average 1.294871794871795) internal successors, (202), 156 states have internal predecessors, (202), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 21:54:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions. [2023-11-06 21:54:25,610 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 150 [2023-11-06 21:54:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:25,611 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 282 transitions. [2023-11-06 21:54:25,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions. [2023-11-06 21:54:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 21:54:25,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:25,615 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:25,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:54:25,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:25,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:25,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2120166937, now seen corresponding path program 1 times [2023-11-06 21:54:25,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:25,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242867262] [2023-11-06 21:54:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:25,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:32,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242867262] [2023-11-06 21:54:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242867262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:32,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:32,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-06 21:54:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190016723] [2023-11-06 21:54:32,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:32,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 21:54:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:32,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 21:54:32,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:54:32,070 INFO L87 Difference]: Start difference. First operand 199 states and 282 transitions. Second operand has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:35,752 INFO L93 Difference]: Finished difference Result 678 states and 952 transitions. [2023-11-06 21:54:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 21:54:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2023-11-06 21:54:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:35,760 INFO L225 Difference]: With dead ends: 678 [2023-11-06 21:54:35,761 INFO L226 Difference]: Without dead ends: 482 [2023-11-06 21:54:35,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2023-11-06 21:54:35,771 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 338 mSDsluCounter, 1376 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:35,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1527 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 21:54:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-11-06 21:54:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 229. [2023-11-06 21:54:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 186 states have (on average 1.3064516129032258) internal successors, (243), 186 states have internal predecessors, (243), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 21:54:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 323 transitions. [2023-11-06 21:54:35,835 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 323 transitions. Word has length 158 [2023-11-06 21:54:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:35,837 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 323 transitions. [2023-11-06 21:54:35,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 323 transitions. [2023-11-06 21:54:35,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-06 21:54:35,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:35,849 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:35,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:54:35,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:35,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1752098533, now seen corresponding path program 1 times [2023-11-06 21:54:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552115711] [2023-11-06 21:54:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:38,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552115711] [2023-11-06 21:54:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552115711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:38,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 21:54:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870070804] [2023-11-06 21:54:38,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:38,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:54:38,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:38,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:54:38,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:54:38,929 INFO L87 Difference]: Start difference. First operand 229 states and 323 transitions. Second operand has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:40,171 INFO L93 Difference]: Finished difference Result 588 states and 828 transitions. [2023-11-06 21:54:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:54:40,172 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2023-11-06 21:54:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:40,175 INFO L225 Difference]: With dead ends: 588 [2023-11-06 21:54:40,175 INFO L226 Difference]: Without dead ends: 362 [2023-11-06 21:54:40,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:54:40,178 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 209 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:40,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1031 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:54:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-11-06 21:54:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 233. [2023-11-06 21:54:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 190 states have (on average 1.3105263157894738) internal successors, (249), 190 states have internal predecessors, (249), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-06 21:54:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2023-11-06 21:54:40,229 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 158 [2023-11-06 21:54:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:40,230 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2023-11-06 21:54:40,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2023-11-06 21:54:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:54:40,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:40,234 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:40,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:54:40,235 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:40,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1171616002, now seen corresponding path program 1 times [2023-11-06 21:54:40,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:40,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47412724] [2023-11-06 21:54:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:40,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:42,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:42,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47412724] [2023-11-06 21:54:42,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47412724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:42,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:42,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:54:42,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211014179] [2023-11-06 21:54:42,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:42,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:54:42,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:54:42,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:54:42,432 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:43,370 INFO L93 Difference]: Finished difference Result 716 states and 1000 transitions. [2023-11-06 21:54:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:54:43,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-06 21:54:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:43,375 INFO L225 Difference]: With dead ends: 716 [2023-11-06 21:54:43,375 INFO L226 Difference]: Without dead ends: 486 [2023-11-06 21:54:43,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:54:43,377 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 229 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:43,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 870 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:54:43,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-11-06 21:54:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 343. [2023-11-06 21:54:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 294 states have (on average 1.3197278911564625) internal successors, (388), 296 states have internal predecessors, (388), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-06 21:54:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 476 transitions. [2023-11-06 21:54:43,415 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 476 transitions. Word has length 160 [2023-11-06 21:54:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:43,416 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 476 transitions. [2023-11-06 21:54:43,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 476 transitions. [2023-11-06 21:54:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:54:43,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:43,419 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:43,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:54:43,419 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:43,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash 269132564, now seen corresponding path program 1 times [2023-11-06 21:54:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:43,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261203383] [2023-11-06 21:54:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:46,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261203383] [2023-11-06 21:54:46,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261203383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:46,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:54:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121147921] [2023-11-06 21:54:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:46,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:54:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:46,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:54:46,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:46,195 INFO L87 Difference]: Start difference. First operand 343 states and 476 transitions. Second operand has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:47,090 INFO L93 Difference]: Finished difference Result 1105 states and 1527 transitions. [2023-11-06 21:54:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 21:54:47,091 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-06 21:54:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:47,098 INFO L225 Difference]: With dead ends: 1105 [2023-11-06 21:54:47,098 INFO L226 Difference]: Without dead ends: 765 [2023-11-06 21:54:47,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-11-06 21:54:47,100 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 212 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:47,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 770 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:54:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-11-06 21:54:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 589. [2023-11-06 21:54:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 524 states have (on average 1.3187022900763359) internal successors, (691), 530 states have internal predecessors, (691), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 21:54:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 803 transitions. [2023-11-06 21:54:47,168 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 803 transitions. Word has length 160 [2023-11-06 21:54:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:47,169 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 803 transitions. [2023-11-06 21:54:47,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 803 transitions. [2023-11-06 21:54:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:54:47,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:47,173 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:47,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:54:47,173 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:47,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1129206588, now seen corresponding path program 1 times [2023-11-06 21:54:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:47,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513826372] [2023-11-06 21:54:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:47,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:47,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513826372] [2023-11-06 21:54:47,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513826372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:47,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:47,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:47,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496646518] [2023-11-06 21:54:47,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:47,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:54:47,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:47,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:54:47,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:54:47,562 INFO L87 Difference]: Start difference. First operand 589 states and 803 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:48,032 INFO L93 Difference]: Finished difference Result 1833 states and 2468 transitions. [2023-11-06 21:54:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:48,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2023-11-06 21:54:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:48,041 INFO L225 Difference]: With dead ends: 1833 [2023-11-06 21:54:48,042 INFO L226 Difference]: Without dead ends: 1247 [2023-11-06 21:54:48,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:54:48,045 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 166 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:48,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 435 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:54:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2023-11-06 21:54:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 597. [2023-11-06 21:54:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 532 states have (on average 1.3139097744360901) internal successors, (699), 538 states have internal predecessors, (699), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 21:54:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 811 transitions. [2023-11-06 21:54:48,129 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 811 transitions. Word has length 160 [2023-11-06 21:54:48,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:48,130 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 811 transitions. [2023-11-06 21:54:48,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:54:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 811 transitions. [2023-11-06 21:54:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:54:48,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:48,134 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:48,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:54:48,134 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:48,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash -150657090, now seen corresponding path program 1 times [2023-11-06 21:54:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:48,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389529306] [2023-11-06 21:54:48,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:51,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389529306] [2023-11-06 21:54:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389529306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:51,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:51,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 21:54:51,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91804068] [2023-11-06 21:54:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:51,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 21:54:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 21:54:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:54:51,226 INFO L87 Difference]: Start difference. First operand 597 states and 811 transitions. Second operand has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-06 21:54:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:52,789 INFO L93 Difference]: Finished difference Result 1568 states and 2115 transitions. [2023-11-06 21:54:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:54:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2023-11-06 21:54:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:52,795 INFO L225 Difference]: With dead ends: 1568 [2023-11-06 21:54:52,795 INFO L226 Difference]: Without dead ends: 974 [2023-11-06 21:54:52,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:54:52,798 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 202 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:52,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 961 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 21:54:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-11-06 21:54:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 597. [2023-11-06 21:54:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 532 states have (on average 1.3139097744360901) internal successors, (699), 538 states have internal predecessors, (699), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 50 states have call predecessors, (56), 56 states have call successors, (56) [2023-11-06 21:54:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 811 transitions. [2023-11-06 21:54:52,887 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 811 transitions. Word has length 160 [2023-11-06 21:54:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:52,888 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 811 transitions. [2023-11-06 21:54:52,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-06 21:54:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 811 transitions. [2023-11-06 21:54:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:54:52,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:52,891 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:54:52,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:52,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash 409681174, now seen corresponding path program 1 times [2023-11-06 21:54:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846454772] [2023-11-06 21:54:52,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846454772] [2023-11-06 21:54:53,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846454772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:53,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:53,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:54:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914325168] [2023-11-06 21:54:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:53,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:53,901 INFO L87 Difference]: Start difference. First operand 597 states and 811 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:54:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:54,381 INFO L93 Difference]: Finished difference Result 1344 states and 1820 transitions. [2023-11-06 21:54:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-11-06 21:54:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:54,387 INFO L225 Difference]: With dead ends: 1344 [2023-11-06 21:54:54,387 INFO L226 Difference]: Without dead ends: 750 [2023-11-06 21:54:54,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:54,390 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 138 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:54,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 588 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:54:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2023-11-06 21:54:54,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 630. [2023-11-06 21:54:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 550 states have (on average 1.2963636363636364) internal successors, (713), 557 states have internal predecessors, (713), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-06 21:54:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 849 transitions. [2023-11-06 21:54:54,496 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 849 transitions. Word has length 160 [2023-11-06 21:54:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:54,497 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 849 transitions. [2023-11-06 21:54:54,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:54:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 849 transitions. [2023-11-06 21:54:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:54:54,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:54,503 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:54,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:54:54,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:54,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1545951006, now seen corresponding path program 1 times [2023-11-06 21:54:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:54,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041322484] [2023-11-06 21:54:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041322484] [2023-11-06 21:54:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041322484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:56,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:56,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:54:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072365029] [2023-11-06 21:54:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:56,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:54:56,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:56,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:54:56,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:54:56,410 INFO L87 Difference]: Start difference. First operand 630 states and 849 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:57,568 INFO L93 Difference]: Finished difference Result 1906 states and 2555 transitions. [2023-11-06 21:54:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:54:57,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-06 21:54:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:57,577 INFO L225 Difference]: With dead ends: 1906 [2023-11-06 21:54:57,577 INFO L226 Difference]: Without dead ends: 1292 [2023-11-06 21:54:57,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:54:57,580 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 166 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:57,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1068 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:54:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2023-11-06 21:54:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 688. [2023-11-06 21:54:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 608 states have (on average 1.3108552631578947) internal successors, (797), 615 states have internal predecessors, (797), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-06 21:54:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 933 transitions. [2023-11-06 21:54:57,675 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 933 transitions. Word has length 160 [2023-11-06 21:54:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:57,678 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 933 transitions. [2023-11-06 21:54:57,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:54:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 933 transitions. [2023-11-06 21:54:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:54:57,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:57,682 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:57,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:54:57,682 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:57,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 524882652, now seen corresponding path program 1 times [2023-11-06 21:54:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93152511] [2023-11-06 21:54:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:54:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:54:59,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:59,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93152511] [2023-11-06 21:54:59,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93152511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:59,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:59,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:54:59,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384925224] [2023-11-06 21:54:59,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:59,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:59,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:59,453 INFO L87 Difference]: Start difference. First operand 688 states and 933 transitions. Second operand has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:00,097 INFO L93 Difference]: Finished difference Result 1602 states and 2156 transitions. [2023-11-06 21:55:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:55:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-06 21:55:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:00,105 INFO L225 Difference]: With dead ends: 1602 [2023-11-06 21:55:00,105 INFO L226 Difference]: Without dead ends: 930 [2023-11-06 21:55:00,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:55:00,108 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 141 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:00,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 627 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:55:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2023-11-06 21:55:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 688. [2023-11-06 21:55:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 608 states have (on average 1.2976973684210527) internal successors, (789), 615 states have internal predecessors, (789), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2023-11-06 21:55:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 925 transitions. [2023-11-06 21:55:00,202 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 925 transitions. Word has length 160 [2023-11-06 21:55:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:00,203 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 925 transitions. [2023-11-06 21:55:00,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.6) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 925 transitions. [2023-11-06 21:55:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:55:00,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:00,206 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:00,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:55:00,206 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:00,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:00,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1148983748, now seen corresponding path program 1 times [2023-11-06 21:55:00,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:00,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235352097] [2023-11-06 21:55:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:00,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:02,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:02,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235352097] [2023-11-06 21:55:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235352097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:55:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112141343] [2023-11-06 21:55:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:02,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:55:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:55:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:55:02,148 INFO L87 Difference]: Start difference. First operand 688 states and 925 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:03,443 INFO L93 Difference]: Finished difference Result 1696 states and 2257 transitions. [2023-11-06 21:55:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 21:55:03,444 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-06 21:55:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:03,450 INFO L225 Difference]: With dead ends: 1696 [2023-11-06 21:55:03,450 INFO L226 Difference]: Without dead ends: 1024 [2023-11-06 21:55:03,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:55:03,453 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 214 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:03,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1038 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:55:03,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2023-11-06 21:55:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 836. [2023-11-06 21:55:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 740 states have (on average 1.2797297297297296) internal successors, (947), 751 states have internal predecessors, (947), 80 states have call successors, (80), 15 states have call predecessors, (80), 15 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-06 21:55:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1107 transitions. [2023-11-06 21:55:03,571 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1107 transitions. Word has length 160 [2023-11-06 21:55:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:03,572 INFO L495 AbstractCegarLoop]: Abstraction has 836 states and 1107 transitions. [2023-11-06 21:55:03,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1107 transitions. [2023-11-06 21:55:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:55:03,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:03,576 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:03,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:55:03,577 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:03,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash -128024836, now seen corresponding path program 1 times [2023-11-06 21:55:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:03,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780653905] [2023-11-06 21:55:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:05,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:05,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780653905] [2023-11-06 21:55:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780653905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:05,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:55:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430297664] [2023-11-06 21:55:05,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:05,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 21:55:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:05,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 21:55:05,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:55:05,223 INFO L87 Difference]: Start difference. First operand 836 states and 1107 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:06,386 INFO L93 Difference]: Finished difference Result 1992 states and 2635 transitions. [2023-11-06 21:55:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:55:06,387 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2023-11-06 21:55:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:06,394 INFO L225 Difference]: With dead ends: 1992 [2023-11-06 21:55:06,394 INFO L226 Difference]: Without dead ends: 1172 [2023-11-06 21:55:06,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:55:06,397 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 172 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:06,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1132 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:55:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-11-06 21:55:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 818. [2023-11-06 21:55:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 722 states have (on average 1.2756232686980609) internal successors, (921), 733 states have internal predecessors, (921), 80 states have call successors, (80), 15 states have call predecessors, (80), 15 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-06 21:55:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1081 transitions. [2023-11-06 21:55:06,525 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1081 transitions. Word has length 160 [2023-11-06 21:55:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:06,525 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1081 transitions. [2023-11-06 21:55:06,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1081 transitions. [2023-11-06 21:55:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:55:06,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:06,528 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:06,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:55:06,529 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:06,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1568583260, now seen corresponding path program 1 times [2023-11-06 21:55:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:06,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492494529] [2023-11-06 21:55:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:07,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:07,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492494529] [2023-11-06 21:55:07,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492494529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:07,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:07,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:55:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801967993] [2023-11-06 21:55:07,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:07,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:55:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:07,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:55:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:55:07,530 INFO L87 Difference]: Start difference. First operand 818 states and 1081 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:55:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:07,932 INFO L93 Difference]: Finished difference Result 1624 states and 2147 transitions. [2023-11-06 21:55:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:55:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-11-06 21:55:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:07,938 INFO L225 Difference]: With dead ends: 1624 [2023-11-06 21:55:07,938 INFO L226 Difference]: Without dead ends: 822 [2023-11-06 21:55:07,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:55:07,941 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 13 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:07,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 495 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2023-11-06 21:55:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 818. [2023-11-06 21:55:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 722 states have (on average 1.2728531855955678) internal successors, (919), 733 states have internal predecessors, (919), 80 states have call successors, (80), 15 states have call predecessors, (80), 15 states have return successors, (80), 69 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-06 21:55:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1079 transitions. [2023-11-06 21:55:08,075 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1079 transitions. Word has length 160 [2023-11-06 21:55:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:08,076 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1079 transitions. [2023-11-06 21:55:08,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:55:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1079 transitions. [2023-11-06 21:55:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:55:08,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:08,079 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:08,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:55:08,080 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:08,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -803156002, now seen corresponding path program 1 times [2023-11-06 21:55:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746140293] [2023-11-06 21:55:08,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:10,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:10,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746140293] [2023-11-06 21:55:10,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746140293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:10,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:10,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 21:55:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029003784] [2023-11-06 21:55:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:10,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:55:10,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:55:10,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:55:10,332 INFO L87 Difference]: Start difference. First operand 818 states and 1079 transitions. Second operand has 10 states, 7 states have (on average 9.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-06 21:55:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:11,442 INFO L93 Difference]: Finished difference Result 1886 states and 2479 transitions. [2023-11-06 21:55:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:55:11,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 9.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2023-11-06 21:55:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:11,449 INFO L225 Difference]: With dead ends: 1886 [2023-11-06 21:55:11,449 INFO L226 Difference]: Without dead ends: 1084 [2023-11-06 21:55:11,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:55:11,453 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 139 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:11,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 930 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 21:55:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2023-11-06 21:55:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 793. [2023-11-06 21:55:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 699 states have (on average 1.2718168812589414) internal successors, (889), 709 states have internal predecessors, (889), 78 states have call successors, (78), 15 states have call predecessors, (78), 15 states have return successors, (78), 68 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-06 21:55:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1045 transitions. [2023-11-06 21:55:11,581 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1045 transitions. Word has length 160 [2023-11-06 21:55:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:11,582 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1045 transitions. [2023-11-06 21:55:11,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 9.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-06 21:55:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1045 transitions. [2023-11-06 21:55:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-06 21:55:11,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:11,585 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:11,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:55:11,585 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:11,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1824224356, now seen corresponding path program 1 times [2023-11-06 21:55:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280763330] [2023-11-06 21:55:11,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:15,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:15,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280763330] [2023-11-06 21:55:15,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280763330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:15,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:15,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 21:55:15,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604191042] [2023-11-06 21:55:15,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:15,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:55:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:15,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:55:15,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:55:15,433 INFO L87 Difference]: Start difference. First operand 793 states and 1045 transitions. Second operand has 13 states, 10 states have (on average 6.3) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-06 21:55:17,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 21:55:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:25,128 INFO L93 Difference]: Finished difference Result 1948 states and 2556 transitions. [2023-11-06 21:55:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 21:55:25,128 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.3) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2023-11-06 21:55:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:25,135 INFO L225 Difference]: With dead ends: 1948 [2023-11-06 21:55:25,135 INFO L226 Difference]: Without dead ends: 1171 [2023-11-06 21:55:25,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:55:25,138 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 165 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:25,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1185 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1096 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-11-06 21:55:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2023-11-06 21:55:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1014. [2023-11-06 21:55:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 901 states have (on average 1.2685904550499445) internal successors, (1143), 914 states have internal predecessors, (1143), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-06 21:55:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1323 transitions. [2023-11-06 21:55:25,315 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1323 transitions. Word has length 160 [2023-11-06 21:55:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:25,316 INFO L495 AbstractCegarLoop]: Abstraction has 1014 states and 1323 transitions. [2023-11-06 21:55:25,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.3) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-11-06 21:55:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1323 transitions. [2023-11-06 21:55:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 21:55:25,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:25,319 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:25,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 21:55:25,319 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:25,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1092955930, now seen corresponding path program 1 times [2023-11-06 21:55:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641972117] [2023-11-06 21:55:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:25,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:25,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641972117] [2023-11-06 21:55:25,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641972117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:25,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:25,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:55:25,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302733611] [2023-11-06 21:55:25,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:25,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:25,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:25,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:25,574 INFO L87 Difference]: Start difference. First operand 1014 states and 1323 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:55:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:25,764 INFO L93 Difference]: Finished difference Result 2145 states and 2808 transitions. [2023-11-06 21:55:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2023-11-06 21:55:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:25,770 INFO L225 Difference]: With dead ends: 2145 [2023-11-06 21:55:25,771 INFO L226 Difference]: Without dead ends: 1134 [2023-11-06 21:55:25,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:55:25,774 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 27 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:25,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 535 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:55:25,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2023-11-06 21:55:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1059. [2023-11-06 21:55:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 946 states have (on average 1.255813953488372) internal successors, (1188), 959 states have internal predecessors, (1188), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-06 21:55:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1368 transitions. [2023-11-06 21:55:25,922 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1368 transitions. Word has length 162 [2023-11-06 21:55:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:25,923 INFO L495 AbstractCegarLoop]: Abstraction has 1059 states and 1368 transitions. [2023-11-06 21:55:25,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:55:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1368 transitions. [2023-11-06 21:55:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 21:55:25,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:25,926 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:25,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 21:55:25,927 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:25,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1057655491, now seen corresponding path program 1 times [2023-11-06 21:55:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:25,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858973893] [2023-11-06 21:55:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858973893] [2023-11-06 21:55:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858973893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 21:55:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984348474] [2023-11-06 21:55:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:27,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 21:55:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 21:55:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:55:27,935 INFO L87 Difference]: Start difference. First operand 1059 states and 1368 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:29,689 INFO L93 Difference]: Finished difference Result 2373 states and 3061 transitions. [2023-11-06 21:55:29,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:55:29,690 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2023-11-06 21:55:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:29,697 INFO L225 Difference]: With dead ends: 2373 [2023-11-06 21:55:29,697 INFO L226 Difference]: Without dead ends: 1317 [2023-11-06 21:55:29,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2023-11-06 21:55:29,701 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 194 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:29,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1590 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 21:55:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-11-06 21:55:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1063. [2023-11-06 21:55:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 950 states have (on average 1.2547368421052632) internal successors, (1192), 963 states have internal predecessors, (1192), 90 states have call successors, (90), 22 states have call predecessors, (90), 22 states have return successors, (90), 77 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-06 21:55:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1372 transitions. [2023-11-06 21:55:29,871 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1372 transitions. Word has length 162 [2023-11-06 21:55:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:29,872 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1372 transitions. [2023-11-06 21:55:29,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1372 transitions. [2023-11-06 21:55:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 21:55:29,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:29,875 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:29,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 21:55:29,876 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:29,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:29,876 INFO L85 PathProgramCache]: Analyzing trace with hash -222208187, now seen corresponding path program 1 times [2023-11-06 21:55:29,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:29,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402108469] [2023-11-06 21:55:29,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:31,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402108469] [2023-11-06 21:55:31,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402108469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:31,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:55:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881252443] [2023-11-06 21:55:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:55:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:55:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:55:31,029 INFO L87 Difference]: Start difference. First operand 1063 states and 1372 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:55:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:31,591 INFO L93 Difference]: Finished difference Result 2730 states and 3495 transitions. [2023-11-06 21:55:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:55:31,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-06 21:55:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:31,598 INFO L225 Difference]: With dead ends: 2730 [2023-11-06 21:55:31,598 INFO L226 Difference]: Without dead ends: 1670 [2023-11-06 21:55:31,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:55:31,601 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 139 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:31,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 520 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:55:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2023-11-06 21:55:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 891. [2023-11-06 21:55:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 794 states have (on average 1.2544080604534005) internal successors, (996), 803 states have internal predecessors, (996), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 69 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-06 21:55:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1152 transitions. [2023-11-06 21:55:31,751 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1152 transitions. Word has length 162 [2023-11-06 21:55:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:31,752 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 1152 transitions. [2023-11-06 21:55:31,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:55:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1152 transitions. [2023-11-06 21:55:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 21:55:31,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:31,755 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 21:55:31,755 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:31,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1851108411, now seen corresponding path program 1 times [2023-11-06 21:55:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:31,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136537088] [2023-11-06 21:55:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:32,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136537088] [2023-11-06 21:55:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136537088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:32,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:32,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:55:32,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893779091] [2023-11-06 21:55:32,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:32,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:55:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:32,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:55:32,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:55:32,718 INFO L87 Difference]: Start difference. First operand 891 states and 1152 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:55:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:33,079 INFO L93 Difference]: Finished difference Result 1723 states and 2229 transitions. [2023-11-06 21:55:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:33,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-06 21:55:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:33,085 INFO L225 Difference]: With dead ends: 1723 [2023-11-06 21:55:33,085 INFO L226 Difference]: Without dead ends: 835 [2023-11-06 21:55:33,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:55:33,088 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 18 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:33,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 490 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:55:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2023-11-06 21:55:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 835. [2023-11-06 21:55:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 738 states have (on average 1.2493224932249323) internal successors, (922), 747 states have internal predecessors, (922), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 69 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-06 21:55:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1078 transitions. [2023-11-06 21:55:33,227 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1078 transitions. Word has length 162 [2023-11-06 21:55:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:33,228 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1078 transitions. [2023-11-06 21:55:33,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 21:55:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1078 transitions. [2023-11-06 21:55:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 21:55:33,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:33,230 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:33,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 21:55:33,231 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:33,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash -555389885, now seen corresponding path program 1 times [2023-11-06 21:55:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071411171] [2023-11-06 21:55:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:35,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071411171] [2023-11-06 21:55:35,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071411171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:35,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-06 21:55:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749186191] [2023-11-06 21:55:35,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:35,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 21:55:35,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:35,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 21:55:35,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:55:35,320 INFO L87 Difference]: Start difference. First operand 835 states and 1078 transitions. Second operand has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:37,756 INFO L93 Difference]: Finished difference Result 2075 states and 2662 transitions. [2023-11-06 21:55:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 21:55:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2023-11-06 21:55:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:37,764 INFO L225 Difference]: With dead ends: 2075 [2023-11-06 21:55:37,764 INFO L226 Difference]: Without dead ends: 1243 [2023-11-06 21:55:37,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2023-11-06 21:55:37,767 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 296 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:37,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1978 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-06 21:55:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-11-06 21:55:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 876. [2023-11-06 21:55:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 779 states have (on average 1.2439024390243902) internal successors, (969), 788 states have internal predecessors, (969), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 69 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-06 21:55:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1125 transitions. [2023-11-06 21:55:37,901 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1125 transitions. Word has length 162 [2023-11-06 21:55:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:37,902 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 1125 transitions. [2023-11-06 21:55:37,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0625) internal successors, (65), 18 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1125 transitions. [2023-11-06 21:55:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-06 21:55:37,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:37,905 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:37,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 21:55:37,905 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:37,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1934139077, now seen corresponding path program 1 times [2023-11-06 21:55:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:37,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051125892] [2023-11-06 21:55:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 21:55:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051125892] [2023-11-06 21:55:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051125892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:39,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 21:55:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597285048] [2023-11-06 21:55:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 21:55:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 21:55:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:55:39,978 INFO L87 Difference]: Start difference. First operand 876 states and 1125 transitions. Second operand has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:41,409 INFO L93 Difference]: Finished difference Result 1848 states and 2369 transitions. [2023-11-06 21:55:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:55:41,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2023-11-06 21:55:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:41,416 INFO L225 Difference]: With dead ends: 1848 [2023-11-06 21:55:41,416 INFO L226 Difference]: Without dead ends: 975 [2023-11-06 21:55:41,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2023-11-06 21:55:41,419 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 198 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:41,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1561 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:55:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2023-11-06 21:55:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 828. [2023-11-06 21:55:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 731 states have (on average 1.2462380300957592) internal successors, (911), 740 states have internal predecessors, (911), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 69 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-06 21:55:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1067 transitions. [2023-11-06 21:55:41,536 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1067 transitions. Word has length 162 [2023-11-06 21:55:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:41,536 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1067 transitions. [2023-11-06 21:55:41,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.642857142857143) internal successors, (65), 16 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 21:55:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1067 transitions. [2023-11-06 21:55:41,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-06 21:55:41,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:41,538 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:41,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 21:55:41,539 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:41,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1940567467, now seen corresponding path program 1 times [2023-11-06 21:55:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327135181] [2023-11-06 21:55:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:41,577 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 21:55:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307172992] [2023-11-06 21:55:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:41,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:41,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:55:41,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:55:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:41,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:55:41,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:42,072 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:42,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2023-11-06 21:55:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 21:55:42,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:55:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327135181] [2023-11-06 21:55:42,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-06 21:55:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307172992] [2023-11-06 21:55:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307172992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:42,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:55:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105341443] [2023-11-06 21:55:42,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:42,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:42,095 INFO L87 Difference]: Start difference. First operand 828 states and 1067 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:55:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:42,764 INFO L93 Difference]: Finished difference Result 2395 states and 3070 transitions. [2023-11-06 21:55:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:42,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2023-11-06 21:55:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:42,772 INFO L225 Difference]: With dead ends: 2395 [2023-11-06 21:55:42,772 INFO L226 Difference]: Without dead ends: 1570 [2023-11-06 21:55:42,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:55:42,774 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 130 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:42,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 301 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:55:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2023-11-06 21:55:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1048. [2023-11-06 21:55:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 951 states have (on average 1.2292323869610935) internal successors, (1169), 960 states have internal predecessors, (1169), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (78), 69 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-06 21:55:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1325 transitions. [2023-11-06 21:55:42,907 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1325 transitions. Word has length 164 [2023-11-06 21:55:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:42,908 INFO L495 AbstractCegarLoop]: Abstraction has 1048 states and 1325 transitions. [2023-11-06 21:55:42,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 21:55:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1325 transitions. [2023-11-06 21:55:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-06 21:55:42,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:42,910 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:42,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 21:55:43,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 21:55:43,122 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:43,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:43,123 INFO L85 PathProgramCache]: Analyzing trace with hash 362288575, now seen corresponding path program 1 times [2023-11-06 21:55:43,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:43,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997507342] [2023-11-06 21:55:43,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:43,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:55:43,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:55:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:55:43,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:55:43,476 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:55:43,478 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 21:55:43,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 21:55:43,483 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:43,487 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:55:43,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:55:43 BoogieIcfgContainer [2023-11-06 21:55:43,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:55:43,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:55:43,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:55:43,598 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:55:43,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:22" (3/4) ... [2023-11-06 21:55:43,601 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:55:43,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:55:43,603 INFO L158 Benchmark]: Toolchain (without parser) took 82042.96ms. Allocated memory was 151.0MB in the beginning and 960.5MB in the end (delta: 809.5MB). Free memory was 108.3MB in the beginning and 729.0MB in the end (delta: -620.6MB). Peak memory consumption was 190.3MB. Max. memory is 16.1GB. [2023-11-06 21:55:43,603 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:55:43,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.64ms. Allocated memory is still 151.0MB. Free memory was 108.3MB in the beginning and 92.0MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 21:55:43,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.70ms. Allocated memory is still 151.0MB. Free memory was 92.0MB in the beginning and 87.4MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 21:55:43,605 INFO L158 Benchmark]: Boogie Preprocessor took 62.75ms. Allocated memory is still 151.0MB. Free memory was 87.4MB in the beginning and 84.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:55:43,605 INFO L158 Benchmark]: RCFGBuilder took 814.00ms. Allocated memory is still 151.0MB. Free memory was 84.1MB in the beginning and 94.5MB in the end (delta: -10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 21:55:43,605 INFO L158 Benchmark]: TraceAbstraction took 80610.92ms. Allocated memory was 151.0MB in the beginning and 960.5MB in the end (delta: 809.5MB). Free memory was 94.5MB in the beginning and 729.0MB in the end (delta: -634.4MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. [2023-11-06 21:55:43,606 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 960.5MB. Free memory is still 729.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:55:43,608 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.64ms. Allocated memory is still 151.0MB. Free memory was 108.3MB in the beginning and 92.0MB in the end (delta: 16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.70ms. Allocated memory is still 151.0MB. Free memory was 92.0MB in the beginning and 87.4MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.75ms. Allocated memory is still 151.0MB. Free memory was 87.4MB in the beginning and 84.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 814.00ms. Allocated memory is still 151.0MB. Free memory was 84.1MB in the beginning and 94.5MB in the end (delta: -10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 80610.92ms. Allocated memory was 151.0MB in the beginning and 960.5MB in the end (delta: 809.5MB). Free memory was 94.5MB in the beginning and 729.0MB in the end (delta: -634.4MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 960.5MB. Free memory is still 729.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L57] unsigned short int last_1_WrapperStruct00_var_1_8 = 64; [L58] signed short int last_1_WrapperStruct00_var_1_11 = -4; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_8 [L116] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L117] EXPR WrapperStruct00.var_1_11 [L117] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L84] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00.var_1_4=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00.var_1_4=-512, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L87] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00.var_1_5=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00.var_1_5=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L90] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00.var_1_6=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00.var_1_6=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L93] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=-49153, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00.var_1_10=-49153, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=-49153, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00.var_1_10=-49153, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00.var_1_13=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00.var_1_13=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00.var_1_13=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=-130, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00.var_1_14=-130, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=-130, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00.var_1_14=-130, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00.var_1_14=-130, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00.var_1_14=-130, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00.var_1_15=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00.var_1_15=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00.var_1_15=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00.var_1_15=16383, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00.var_1_18=10000000000003, WrapperStruct00.var_1_18=10000000000003, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )=1, WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F=1, WrapperStruct00.var_1_18=10000000000003, WrapperStruct00.var_1_18=10000000000003, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )=1, WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F=1, WrapperStruct00.var_1_18=10000000000003, WrapperStruct00.var_1_18=10000000000003, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] RET updateVariables() [L129] CALL step() [L62] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L63] COND TRUE stepLocal_0 != last_1_WrapperStruct00_var_1_8 [L64] EXPR WrapperStruct00.var_1_4 [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L64] EXPR WrapperStruct00.var_1_7 VAL [((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L64] EXPR WrapperStruct00.var_1_7 [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L64] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))) [L68] WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L68] COND TRUE WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_10 [L69] EXPR WrapperStruct00.var_1_6 [L69] WrapperStruct00.var_1_8 = ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)) [L71] EXPR WrapperStruct00.var_1_5 [L71] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_5=-256, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L71] COND TRUE ! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10) [L72] WrapperStruct00.var_1_16 = (32 - 8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L76] EXPR WrapperStruct00.var_1_18 [L76] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L77] EXPR WrapperStruct00.var_1_1 [L77] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_1=24, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L77] COND FALSE !(WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_7 VAL [((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) [L120] EXPR WrapperStruct00.var_1_9 VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_16 VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)=1, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1 VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)=1, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)=1, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_10 VAL [((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))=1, (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)=1, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) VAL [(! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))=1, ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))=1, (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)=1, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) VAL [(! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))=1, ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))=1, (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)=1, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) [L120] EXPR WrapperStruct00.var_1_17 [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) VAL [(! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))=1, ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)=24, ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))=1, (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)=1, ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)=0, ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)=1, (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1=1, (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))=1, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_10=-49153, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_16=24, WrapperStruct00.var_1_17=10000000000003, WrapperStruct00.var_1_18=10000000000003, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_1=24, WrapperStruct00.var_1_4=-512, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_5=-256, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_6=-511, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_7=-232, WrapperStruct00.var_1_8=39453, WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1=1, WrapperStruct00.var_1_9=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120-L121] return (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.4s, OverallIterations: 25, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3860 SdHoareTripleChecker+Valid, 21.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3825 mSDsluCounter, 20586 SdHoareTripleChecker+Invalid, 19.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17163 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14047 IncrementalHoareTripleChecker+Invalid, 14312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 3423 mSDtfsCounter, 14047 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1695 GetRequests, 1396 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1063occurred in iteration=19, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 5869 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 3986 NumberOfCodeBlocks, 3986 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3798 ConstructedInterpolants, 0 QuantifiedInterpolants, 16031 SizeOfPredicates, 4 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 18240/18240 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 [2023-11-06 21:55:43,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:55:46,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:55:46,472 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:55:46,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:55:46,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:55:46,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:55:46,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:55:46,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:55:46,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:55:46,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:55:46,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:55:46,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:55:46,534 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:55:46,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:55:46,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:55:46,537 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:55:46,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:55:46,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:55:46,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:55:46,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:55:46,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:55:46,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:55:46,541 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:55:46,542 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:55:46,542 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:55:46,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:55:46,543 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:55:46,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:55:46,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:55:46,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:55:46,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:46,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:55:46,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:55:46,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:55:46,547 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:55:46,547 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:55:46,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:55:46,547 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:55:46,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:55:46,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:55:46,549 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:55:46,549 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:55:46,550 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2023-11-06 21:55:46,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:55:46,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:55:46,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:55:46,973 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:55:46,974 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:55:46,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2023-11-06 21:55:50,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:55:50,338 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:55:50,339 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2023-11-06 21:55:50,348 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/data/60156220c/23834180110d4a66baaf4eb1a2008ecd/FLAG0d45a6dac [2023-11-06 21:55:50,364 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/data/60156220c/23834180110d4a66baaf4eb1a2008ecd [2023-11-06 21:55:50,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:55:50,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:55:50,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:50,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:55:50,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:55:50,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:50,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740e44d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50, skipping insertion in model container [2023-11-06 21:55:50,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:50,410 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:55:50,569 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i[916,929] [2023-11-06 21:55:50,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:50,687 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:55:50,710 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i[916,929] [2023-11-06 21:55:50,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:50,840 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:55:50,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50 WrapperNode [2023-11-06 21:55:50,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:50,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:55:50,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:55:50,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:55:50,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:50,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:50,954 INFO L138 Inliner]: procedures = 33, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 374 [2023-11-06 21:55:50,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:55:50,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:55:50,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:55:50,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:55:50,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:50,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:50,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:51,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:51,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:51,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:51,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:51,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:51,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:55:51,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:55:51,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:55:51,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:55:51,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (1/1) ... [2023-11-06 21:55:51,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:51,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:55:51,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:55:51,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:55:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:55:51,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 21:55:51,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:55:51,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 21:55:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 21:55:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 21:55:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 21:55:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:55:51,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:55:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:55:51,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:55:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:55:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 21:55:51,370 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:55:51,373 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:55:52,255 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:55:52,264 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:55:52,265 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:55:52,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:55:52 BoogieIcfgContainer [2023-11-06 21:55:52,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:55:52,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:55:52,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:55:52,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:55:52,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:55:50" (1/3) ... [2023-11-06 21:55:52,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad74c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:55:52, skipping insertion in model container [2023-11-06 21:55:52,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:50" (2/3) ... [2023-11-06 21:55:52,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad74c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:55:52, skipping insertion in model container [2023-11-06 21:55:52,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:55:52" (3/3) ... [2023-11-06 21:55:52,277 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2023-11-06 21:55:52,298 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:55:52,299 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:55:52,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:55:52,367 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@51396d26, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:55:52,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:55:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 21:55:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-06 21:55:52,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:52,392 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:52,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:52,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 924800917, now seen corresponding path program 1 times [2023-11-06 21:55:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:52,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512478218] [2023-11-06 21:55:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:52,414 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 [2023-11-06 21:55:52,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:52,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) [2023-11-06 21:55:52,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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 [2023-11-06 21:55:52,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:55:52,729 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 21:55:52,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 139 [2023-11-06 21:55:52,736 INFO L158 Benchmark]: Toolchain (without parser) took 2366.30ms. Allocated memory was 77.6MB in the beginning and 119.5MB in the end (delta: 41.9MB). Free memory was 49.3MB in the beginning and 64.1MB in the end (delta: -14.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-06 21:55:52,737 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 77.6MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:55:52,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.32ms. Allocated memory was 77.6MB in the beginning and 119.5MB in the end (delta: 41.9MB). Free memory was 49.1MB in the beginning and 93.3MB in the end (delta: -44.2MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2023-11-06 21:55:52,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.38ms. Allocated memory is still 119.5MB. Free memory was 93.3MB in the beginning and 90.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:55:52,739 INFO L158 Benchmark]: Boogie Preprocessor took 114.71ms. Allocated memory is still 119.5MB. Free memory was 89.6MB in the beginning and 86.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:55:52,740 INFO L158 Benchmark]: RCFGBuilder took 1192.69ms. Allocated memory is still 119.5MB. Free memory was 86.3MB in the beginning and 87.1MB in the end (delta: -823.2kB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-11-06 21:55:52,741 INFO L158 Benchmark]: TraceAbstraction took 462.10ms. Allocated memory is still 119.5MB. Free memory was 86.4MB in the beginning and 64.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 21:55:52,744 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.31ms. Allocated memory is still 77.6MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.32ms. Allocated memory was 77.6MB in the beginning and 119.5MB in the end (delta: 41.9MB). Free memory was 49.1MB in the beginning and 93.3MB in the end (delta: -44.2MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.38ms. Allocated memory is still 119.5MB. Free memory was 93.3MB in the beginning and 90.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.71ms. Allocated memory is still 119.5MB. Free memory was 89.6MB in the beginning and 86.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1192.69ms. Allocated memory is still 119.5MB. Free memory was 86.3MB in the beginning and 87.1MB in the end (delta: -823.2kB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 462.10ms. Allocated memory is still 119.5MB. Free memory was 86.4MB in the beginning and 64.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 21:55:52,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaf534b-cb1c-43b2-9ec7-4985aab75a2e/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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) with exit command (exit)) Received EOF on stdin. No stderr output.