./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:04:45,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:04:45,373 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:04:45,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:04:45,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:04:45,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:04:45,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:04:45,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:04:45,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:04:45,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:04:45,430 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:04:45,430 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:04:45,430 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:04:45,430 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:04:45,430 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:04:45,430 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:04:45,430 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:04:45,430 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:04:45,434 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:04:45,434 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:04:45,434 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:04:45,434 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:04:45,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:04:45,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:04:45,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:04:45,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:04:45,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:04:45,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:04:45,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:04:45,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:04:45,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:04:45,436 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:04:45,436 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:04:45,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:04:45,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:04:45,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:04:45,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:04:45,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:04:45,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:04:45,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:04:45,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:04:45,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:04:45,440 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:04:45,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:04:45,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:04:45,440 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:04:45,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:04:45,441 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2024-11-14 05:04:45,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:04:45,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:04:45,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:04:45,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:04:45,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:04:45,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/systemc/transmitter.02.cil.c Unable to find full path for "g++" [2024-11-14 05:04:48,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:04:48,594 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:04:48,598 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-14 05:04:48,611 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/data/55ccc43e3/25c0f7811d0d42faaedcfb1ad6990c5b/FLAG12abcb05e [2024-11-14 05:04:48,868 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/data/55ccc43e3/25c0f7811d0d42faaedcfb1ad6990c5b [2024-11-14 05:04:48,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:04:48,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:04:48,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:04:48,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:04:48,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:04:48,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:48" (1/1) ... [2024-11-14 05:04:48,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fe8933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:48, skipping insertion in model container [2024-11-14 05:04:48,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:04:48" (1/1) ... [2024-11-14 05:04:48,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:04:49,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2024-11-14 05:04:49,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:04:49,196 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:04:49,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2024-11-14 05:04:49,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:04:49,271 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:04:49,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49 WrapperNode [2024-11-14 05:04:49,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:04:49,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:04:49,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:04:49,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:04:49,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,320 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 263 [2024-11-14 05:04:49,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:04:49,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:04:49,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:04:49,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:04:49,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:04:49,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:04:49,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:04:49,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:04:49,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (1/1) ... [2024-11-14 05:04:49,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:04:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:04:49,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:04:49,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:04:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:04:49,462 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-14 05:04:49,462 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-14 05:04:49,462 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-14 05:04:49,462 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-14 05:04:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-14 05:04:49,463 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-14 05:04:49,463 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-14 05:04:49,464 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-14 05:04:49,464 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-14 05:04:49,464 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-14 05:04:49,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:04:49,464 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-14 05:04:49,464 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-14 05:04:49,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:04:49,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:04:49,589 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:04:49,593 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:04:50,077 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-14 05:04:50,077 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:04:50,294 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:04:50,294 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-14 05:04:50,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:50 BoogieIcfgContainer [2024-11-14 05:04:50,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:04:50,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:04:50,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:04:50,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:04:50,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:04:48" (1/3) ... [2024-11-14 05:04:50,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11243e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:50, skipping insertion in model container [2024-11-14 05:04:50,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:04:49" (2/3) ... [2024-11-14 05:04:50,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11243e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:04:50, skipping insertion in model container [2024-11-14 05:04:50,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:50" (3/3) ... [2024-11-14 05:04:50,310 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2024-11-14 05:04:50,345 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:04:50,347 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.02.cil.c that has 7 procedures, 79 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-11-14 05:04:50,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:04:50,425 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22ca8e88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:04:50,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 05:04:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 58 states have internal predecessors, (82), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-14 05:04:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:04:50,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:50,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:50,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash -981452715, now seen corresponding path program 1 times [2024-11-14 05:04:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20262780] [2024-11-14 05:04:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:04:50,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20262780] [2024-11-14 05:04:50,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20262780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:04:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679159777] [2024-11-14 05:04:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:50,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:04:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:51,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:04:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:04:51,020 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 58 states have internal predecessors, (82), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 05:04:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:51,418 INFO L93 Difference]: Finished difference Result 220 states and 318 transitions. [2024-11-14 05:04:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:04:51,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-14 05:04:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:51,430 INFO L225 Difference]: With dead ends: 220 [2024-11-14 05:04:51,430 INFO L226 Difference]: Without dead ends: 142 [2024-11-14 05:04:51,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:04:51,438 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 175 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:51,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 250 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:04:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-14 05:04:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-14 05:04:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 101 states have (on average 1.3267326732673268) internal successors, (134), 102 states have internal predecessors, (134), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-14 05:04:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2024-11-14 05:04:51,508 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 37 [2024-11-14 05:04:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:51,509 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2024-11-14 05:04:51,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 05:04:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2024-11-14 05:04:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:04:51,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:51,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:51,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:04:51,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:51,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1640996950, now seen corresponding path program 1 times [2024-11-14 05:04:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196866025] [2024-11-14 05:04:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:04:51,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196866025] [2024-11-14 05:04:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196866025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:04:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452682379] [2024-11-14 05:04:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:51,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:04:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:04:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:04:51,749 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 05:04:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:52,417 INFO L93 Difference]: Finished difference Result 462 states and 615 transitions. [2024-11-14 05:04:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:04:52,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-14 05:04:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:52,421 INFO L225 Difference]: With dead ends: 462 [2024-11-14 05:04:52,421 INFO L226 Difference]: Without dead ends: 312 [2024-11-14 05:04:52,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:04:52,424 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 317 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:52,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 373 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:04:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-14 05:04:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 302. [2024-11-14 05:04:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 223 states have (on average 1.3094170403587444) internal successors, (292), 222 states have internal predecessors, (292), 50 states have call successors, (50), 26 states have call predecessors, (50), 28 states have return successors, (54), 54 states have call predecessors, (54), 50 states have call successors, (54) [2024-11-14 05:04:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 396 transitions. [2024-11-14 05:04:52,492 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 396 transitions. Word has length 37 [2024-11-14 05:04:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:52,492 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 396 transitions. [2024-11-14 05:04:52,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 05:04:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 396 transitions. [2024-11-14 05:04:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 05:04:52,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:52,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:52,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:04:52,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:52,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1637857110, now seen corresponding path program 1 times [2024-11-14 05:04:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:52,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792599009] [2024-11-14 05:04:52,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:04:52,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792599009] [2024-11-14 05:04:52,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792599009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:52,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:52,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:04:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146471268] [2024-11-14 05:04:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:52,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:04:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:52,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:04:52,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:04:52,935 INFO L87 Difference]: Start difference. First operand 302 states and 396 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 05:04:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:53,423 INFO L93 Difference]: Finished difference Result 818 states and 1069 transitions. [2024-11-14 05:04:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:04:53,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-14 05:04:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:53,438 INFO L225 Difference]: With dead ends: 818 [2024-11-14 05:04:53,438 INFO L226 Difference]: Without dead ends: 522 [2024-11-14 05:04:53,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:04:53,442 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 235 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:53,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 208 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:04:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-14 05:04:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 489. [2024-11-14 05:04:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 364 states have (on average 1.2967032967032968) internal successors, (472), 361 states have internal predecessors, (472), 76 states have call successors, (76), 44 states have call predecessors, (76), 48 states have return successors, (84), 84 states have call predecessors, (84), 76 states have call successors, (84) [2024-11-14 05:04:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 632 transitions. [2024-11-14 05:04:53,562 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 632 transitions. Word has length 50 [2024-11-14 05:04:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:53,562 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 632 transitions. [2024-11-14 05:04:53,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 05:04:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 632 transitions. [2024-11-14 05:04:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-14 05:04:53,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:53,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:53,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:04:53,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:53,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:53,569 INFO L85 PathProgramCache]: Analyzing trace with hash 746284438, now seen corresponding path program 1 times [2024-11-14 05:04:53,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:53,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726081532] [2024-11-14 05:04:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:04:53,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:53,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726081532] [2024-11-14 05:04:53,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726081532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:53,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:04:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908129112] [2024-11-14 05:04:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:53,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:04:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:04:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:04:53,882 INFO L87 Difference]: Start difference. First operand 489 states and 632 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 05:04:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:54,436 INFO L93 Difference]: Finished difference Result 1467 states and 1886 transitions. [2024-11-14 05:04:54,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:04:54,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2024-11-14 05:04:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:54,450 INFO L225 Difference]: With dead ends: 1467 [2024-11-14 05:04:54,450 INFO L226 Difference]: Without dead ends: 984 [2024-11-14 05:04:54,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 05:04:54,453 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 237 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:54,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 199 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:04:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-14 05:04:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 902. [2024-11-14 05:04:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 677 states have (on average 1.2747415066469718) internal successors, (863), 672 states have internal predecessors, (863), 136 states have call successors, (136), 82 states have call predecessors, (136), 88 states have return successors, (148), 148 states have call predecessors, (148), 136 states have call successors, (148) [2024-11-14 05:04:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1147 transitions. [2024-11-14 05:04:54,647 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1147 transitions. Word has length 54 [2024-11-14 05:04:54,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:54,650 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1147 transitions. [2024-11-14 05:04:54,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 05:04:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1147 transitions. [2024-11-14 05:04:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-14 05:04:54,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:54,654 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:54,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:04:54,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:54,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1554061738, now seen corresponding path program 1 times [2024-11-14 05:04:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661252464] [2024-11-14 05:04:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:04:54,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661252464] [2024-11-14 05:04:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661252464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:54,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:54,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:04:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134173031] [2024-11-14 05:04:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:54,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:04:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:54,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:04:54,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:54,782 INFO L87 Difference]: Start difference. First operand 902 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 05:04:55,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:55,055 INFO L93 Difference]: Finished difference Result 1685 states and 2158 transitions. [2024-11-14 05:04:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:04:55,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2024-11-14 05:04:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:55,067 INFO L225 Difference]: With dead ends: 1685 [2024-11-14 05:04:55,070 INFO L226 Difference]: Without dead ends: 1162 [2024-11-14 05:04:55,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:55,074 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:55,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 223 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:04:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-14 05:04:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 988. [2024-11-14 05:04:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 751 states have (on average 1.2689747003994674) internal successors, (953), 746 states have internal predecessors, (953), 142 states have call successors, (142), 88 states have call predecessors, (142), 94 states have return successors, (154), 154 states have call predecessors, (154), 142 states have call successors, (154) [2024-11-14 05:04:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1249 transitions. [2024-11-14 05:04:55,274 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1249 transitions. Word has length 58 [2024-11-14 05:04:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:55,275 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1249 transitions. [2024-11-14 05:04:55,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-14 05:04:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1249 transitions. [2024-11-14 05:04:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-14 05:04:55,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:55,282 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:04:55,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1753378881, now seen corresponding path program 1 times [2024-11-14 05:04:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483770490] [2024-11-14 05:04:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:55,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 05:04:55,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:55,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483770490] [2024-11-14 05:04:55,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483770490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:55,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:55,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:04:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653953894] [2024-11-14 05:04:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:55,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:04:55,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:55,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:04:55,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:55,378 INFO L87 Difference]: Start difference. First operand 988 states and 1249 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 05:04:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:55,612 INFO L93 Difference]: Finished difference Result 1705 states and 2174 transitions. [2024-11-14 05:04:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:04:55,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-11-14 05:04:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:55,626 INFO L225 Difference]: With dead ends: 1705 [2024-11-14 05:04:55,626 INFO L226 Difference]: Without dead ends: 1084 [2024-11-14 05:04:55,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:55,629 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 71 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:55,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 170 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:04:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-14 05:04:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 862. [2024-11-14 05:04:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 655 states have (on average 1.2687022900763358) internal successors, (831), 656 states have internal predecessors, (831), 126 states have call successors, (126), 80 states have call predecessors, (126), 80 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-14 05:04:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1083 transitions. [2024-11-14 05:04:55,791 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1083 transitions. Word has length 61 [2024-11-14 05:04:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:55,792 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1083 transitions. [2024-11-14 05:04:55,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 05:04:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1083 transitions. [2024-11-14 05:04:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-14 05:04:55,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:55,795 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:55,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:04:55,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:55,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash 66620384, now seen corresponding path program 1 times [2024-11-14 05:04:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228593170] [2024-11-14 05:04:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:04:55,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228593170] [2024-11-14 05:04:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228593170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:55,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:55,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:04:55,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470896415] [2024-11-14 05:04:55,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:55,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:04:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:04:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:55,909 INFO L87 Difference]: Start difference. First operand 862 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-14 05:04:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:56,145 INFO L93 Difference]: Finished difference Result 2134 states and 2687 transitions. [2024-11-14 05:04:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:04:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 77 [2024-11-14 05:04:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:56,154 INFO L225 Difference]: With dead ends: 2134 [2024-11-14 05:04:56,155 INFO L226 Difference]: Without dead ends: 1277 [2024-11-14 05:04:56,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:56,159 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 70 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:56,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 167 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:04:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2024-11-14 05:04:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1266. [2024-11-14 05:04:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 967 states have (on average 1.2471561530506723) internal successors, (1206), 968 states have internal predecessors, (1206), 181 states have call successors, (181), 117 states have call predecessors, (181), 117 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2024-11-14 05:04:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1568 transitions. [2024-11-14 05:04:56,360 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1568 transitions. Word has length 77 [2024-11-14 05:04:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:56,360 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1568 transitions. [2024-11-14 05:04:56,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-14 05:04:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1568 transitions. [2024-11-14 05:04:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-14 05:04:56,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:56,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:04:56,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:56,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -45372627, now seen corresponding path program 1 times [2024-11-14 05:04:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223174194] [2024-11-14 05:04:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:56,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 05:04:56,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:56,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223174194] [2024-11-14 05:04:56,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223174194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:56,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:56,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:04:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487368433] [2024-11-14 05:04:56,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:56,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:04:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:56,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:04:56,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:04:56,630 INFO L87 Difference]: Start difference. First operand 1266 states and 1568 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 05:04:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:56,972 INFO L93 Difference]: Finished difference Result 2342 states and 2933 transitions. [2024-11-14 05:04:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:04:56,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2024-11-14 05:04:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:56,983 INFO L225 Difference]: With dead ends: 2342 [2024-11-14 05:04:56,983 INFO L226 Difference]: Without dead ends: 1624 [2024-11-14 05:04:56,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:04:56,986 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 90 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:56,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 226 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:04:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-11-14 05:04:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1576. [2024-11-14 05:04:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1253 states have (on average 1.2394253790901835) internal successors, (1553), 1254 states have internal predecessors, (1553), 181 states have call successors, (181), 141 states have call predecessors, (181), 141 states have return successors, (193), 181 states have call predecessors, (193), 181 states have call successors, (193) [2024-11-14 05:04:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1927 transitions. [2024-11-14 05:04:57,186 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1927 transitions. Word has length 78 [2024-11-14 05:04:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:57,187 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1927 transitions. [2024-11-14 05:04:57,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-14 05:04:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1927 transitions. [2024-11-14 05:04:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-14 05:04:57,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:57,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:57,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:04:57,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:57,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1094979084, now seen corresponding path program 1 times [2024-11-14 05:04:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:57,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112179483] [2024-11-14 05:04:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-14 05:04:57,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:57,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112179483] [2024-11-14 05:04:57,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112179483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:57,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:57,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:04:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254570967] [2024-11-14 05:04:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:57,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:04:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:04:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:04:57,276 INFO L87 Difference]: Start difference. First operand 1576 states and 1927 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 05:04:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:57,674 INFO L93 Difference]: Finished difference Result 2437 states and 3039 transitions. [2024-11-14 05:04:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:04:57,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-14 05:04:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:57,685 INFO L225 Difference]: With dead ends: 2437 [2024-11-14 05:04:57,685 INFO L226 Difference]: Without dead ends: 1558 [2024-11-14 05:04:57,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:04:57,690 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 171 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:57,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 250 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:04:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2024-11-14 05:04:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1542. [2024-11-14 05:04:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1222 states have (on average 1.2111292962356792) internal successors, (1480), 1220 states have internal predecessors, (1480), 181 states have call successors, (181), 141 states have call predecessors, (181), 138 states have return successors, (190), 181 states have call predecessors, (190), 181 states have call successors, (190) [2024-11-14 05:04:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1851 transitions. [2024-11-14 05:04:57,869 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1851 transitions. Word has length 78 [2024-11-14 05:04:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:57,870 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1851 transitions. [2024-11-14 05:04:57,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-14 05:04:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1851 transitions. [2024-11-14 05:04:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-14 05:04:57,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:57,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:57,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:04:57,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:57,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1003750791, now seen corresponding path program 1 times [2024-11-14 05:04:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:57,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109062736] [2024-11-14 05:04:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:04:58,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:58,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109062736] [2024-11-14 05:04:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109062736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:58,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:58,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:04:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081411437] [2024-11-14 05:04:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:58,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:04:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:04:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:04:58,189 INFO L87 Difference]: Start difference. First operand 1542 states and 1851 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-14 05:04:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:58,858 INFO L93 Difference]: Finished difference Result 2886 states and 3491 transitions. [2024-11-14 05:04:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:04:58,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2024-11-14 05:04:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:58,873 INFO L225 Difference]: With dead ends: 2886 [2024-11-14 05:04:58,873 INFO L226 Difference]: Without dead ends: 2194 [2024-11-14 05:04:58,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:04:58,876 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 68 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:58,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 364 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:04:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2024-11-14 05:04:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2147. [2024-11-14 05:04:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1698 states have (on average 1.2055359246171966) internal successors, (2047), 1687 states have internal predecessors, (2047), 259 states have call successors, (259), 201 states have call predecessors, (259), 189 states have return successors, (277), 259 states have call predecessors, (277), 259 states have call successors, (277) [2024-11-14 05:04:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2583 transitions. [2024-11-14 05:04:59,147 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2583 transitions. Word has length 79 [2024-11-14 05:04:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:59,147 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 2583 transitions. [2024-11-14 05:04:59,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-14 05:04:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2583 transitions. [2024-11-14 05:04:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-14 05:04:59,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:59,151 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:59,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:04:59,152 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1103882294, now seen corresponding path program 1 times [2024-11-14 05:04:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859167874] [2024-11-14 05:04:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:04:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 05:04:59,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:04:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859167874] [2024-11-14 05:04:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859167874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:04:59,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:04:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:04:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596487746] [2024-11-14 05:04:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:04:59,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:04:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:04:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:04:59,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:59,261 INFO L87 Difference]: Start difference. First operand 2147 states and 2583 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-14 05:04:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:04:59,565 INFO L93 Difference]: Finished difference Result 3987 states and 4851 transitions. [2024-11-14 05:04:59,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:04:59,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2024-11-14 05:04:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:04:59,581 INFO L225 Difference]: With dead ends: 3987 [2024-11-14 05:04:59,581 INFO L226 Difference]: Without dead ends: 2511 [2024-11-14 05:04:59,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:04:59,586 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 40 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:04:59,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 205 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:04:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2024-11-14 05:04:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2261. [2024-11-14 05:04:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 1794 states have (on average 1.2079152731326643) internal successors, (2167), 1783 states have internal predecessors, (2167), 268 states have call successors, (268), 210 states have call predecessors, (268), 198 states have return successors, (286), 268 states have call predecessors, (286), 268 states have call successors, (286) [2024-11-14 05:04:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2721 transitions. [2024-11-14 05:04:59,885 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2721 transitions. Word has length 79 [2024-11-14 05:04:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:04:59,886 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2721 transitions. [2024-11-14 05:04:59,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-14 05:04:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2721 transitions. [2024-11-14 05:04:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-14 05:04:59,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:04:59,892 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:04:59,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:04:59,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:04:59,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:04:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 558930769, now seen corresponding path program 1 times [2024-11-14 05:04:59,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:04:59,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411255488] [2024-11-14 05:04:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:04:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:04:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 05:05:00,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:05:00,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411255488] [2024-11-14 05:05:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411255488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:05:00,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747683870] [2024-11-14 05:05:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:00,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:05:00,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:05:00,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:05:00,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:05:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:00,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:05:00,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:05:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:05:00,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:05:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747683870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:05:00,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:05:00,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2024-11-14 05:05:00,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961710189] [2024-11-14 05:05:00,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:05:00,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:05:00,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:05:00,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:05:00,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-14 05:05:00,887 INFO L87 Difference]: Start difference. First operand 2261 states and 2721 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-14 05:05:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:05:01,293 INFO L93 Difference]: Finished difference Result 3451 states and 4155 transitions. [2024-11-14 05:05:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:05:01,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 99 [2024-11-14 05:05:01,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:05:01,302 INFO L225 Difference]: With dead ends: 3451 [2024-11-14 05:05:01,303 INFO L226 Difference]: Without dead ends: 1196 [2024-11-14 05:05:01,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:05:01,308 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 39 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:05:01,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 444 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:05:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-11-14 05:05:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1191. [2024-11-14 05:05:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 967 states have (on average 1.204756980351603) internal successors, (1165), 964 states have internal predecessors, (1165), 125 states have call successors, (125), 102 states have call predecessors, (125), 98 states have return successors, (131), 125 states have call predecessors, (131), 125 states have call successors, (131) [2024-11-14 05:05:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1421 transitions. [2024-11-14 05:05:01,490 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1421 transitions. Word has length 99 [2024-11-14 05:05:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:05:01,491 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1421 transitions. [2024-11-14 05:05:01,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-14 05:05:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1421 transitions. [2024-11-14 05:05:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-14 05:05:01,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:05:01,496 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:05:01,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:05:01,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 05:05:01,700 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:05:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:05:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1209915462, now seen corresponding path program 1 times [2024-11-14 05:05:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:05:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156069183] [2024-11-14 05:05:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:05:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-14 05:05:01,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:05:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156069183] [2024-11-14 05:05:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156069183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:05:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233351205] [2024-11-14 05:05:01,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:01,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:05:01,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:05:01,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:05:01,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:05:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:01,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 05:05:01,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:05:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:05:02,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:05:02,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233351205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:05:02,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:05:02,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-14 05:05:02,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187597500] [2024-11-14 05:05:02,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:05:02,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:05:02,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:05:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:05:02,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:05:02,024 INFO L87 Difference]: Start difference. First operand 1191 states and 1421 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:05:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:05:02,240 INFO L93 Difference]: Finished difference Result 1937 states and 2351 transitions. [2024-11-14 05:05:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:05:02,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2024-11-14 05:05:02,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:05:02,249 INFO L225 Difference]: With dead ends: 1937 [2024-11-14 05:05:02,249 INFO L226 Difference]: Without dead ends: 1199 [2024-11-14 05:05:02,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:05:02,252 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:05:02,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 220 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:05:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-11-14 05:05:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1187. [2024-11-14 05:05:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 963 states have (on average 1.1744548286604362) internal successors, (1131), 960 states have internal predecessors, (1131), 125 states have call successors, (125), 102 states have call predecessors, (125), 98 states have return successors, (131), 125 states have call predecessors, (131), 125 states have call successors, (131) [2024-11-14 05:05:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1387 transitions. [2024-11-14 05:05:02,386 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1387 transitions. Word has length 100 [2024-11-14 05:05:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:05:02,386 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1387 transitions. [2024-11-14 05:05:02,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-14 05:05:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1387 transitions. [2024-11-14 05:05:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-14 05:05:02,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:05:02,390 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:05:02,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:05:02,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 05:05:02,591 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:05:02,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:05:02,592 INFO L85 PathProgramCache]: Analyzing trace with hash -419905340, now seen corresponding path program 1 times [2024-11-14 05:05:02,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:05:02,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648860741] [2024-11-14 05:05:02,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:05:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-14 05:05:02,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:05:02,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648860741] [2024-11-14 05:05:02,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648860741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:05:02,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:05:02,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:05:02,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615308817] [2024-11-14 05:05:02,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:05:02,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:05:02,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:05:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:05:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:05:02,716 INFO L87 Difference]: Start difference. First operand 1187 states and 1387 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-14 05:05:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:05:02,996 INFO L93 Difference]: Finished difference Result 1915 states and 2272 transitions. [2024-11-14 05:05:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:05:02,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-14 05:05:02,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:05:03,008 INFO L225 Difference]: With dead ends: 1915 [2024-11-14 05:05:03,008 INFO L226 Difference]: Without dead ends: 1185 [2024-11-14 05:05:03,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:05:03,011 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 99 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:05:03,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 157 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:05:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2024-11-14 05:05:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2024-11-14 05:05:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 961 states have (on average 1.1560874089490114) internal successors, (1111), 958 states have internal predecessors, (1111), 125 states have call successors, (125), 102 states have call predecessors, (125), 98 states have return successors, (131), 125 states have call predecessors, (131), 125 states have call successors, (131) [2024-11-14 05:05:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1367 transitions. [2024-11-14 05:05:03,152 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1367 transitions. Word has length 100 [2024-11-14 05:05:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:05:03,152 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1367 transitions. [2024-11-14 05:05:03,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-14 05:05:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1367 transitions. [2024-11-14 05:05:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-14 05:05:03,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:05:03,156 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:05:03,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:05:03,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:05:03,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:05:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1619527161, now seen corresponding path program 1 times [2024-11-14 05:05:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:05:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020684991] [2024-11-14 05:05:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:05:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-14 05:05:03,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:05:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020684991] [2024-11-14 05:05:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020684991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:05:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012766647] [2024-11-14 05:05:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:05:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:05:03,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:05:03,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:05:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:05:03,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 05:05:03,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:05:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 05:05:03,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:05:03,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012766647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:05:03,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:05:03,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-14 05:05:03,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95826392] [2024-11-14 05:05:03,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:05:03,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:05:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:05:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:05:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:05:03,801 INFO L87 Difference]: Start difference. First operand 1185 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 05:05:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:05:04,157 INFO L93 Difference]: Finished difference Result 2597 states and 3020 transitions. [2024-11-14 05:05:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:05:04,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2024-11-14 05:05:04,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:05:04,170 INFO L225 Difference]: With dead ends: 2597 [2024-11-14 05:05:04,170 INFO L226 Difference]: Without dead ends: 1886 [2024-11-14 05:05:04,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:05:04,175 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 97 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:05:04,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 226 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:05:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2024-11-14 05:05:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1381. [2024-11-14 05:05:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1132 states have (on average 1.1634275618374559) internal successors, (1317), 1131 states have internal predecessors, (1317), 137 states have call successors, (137), 114 states have call predecessors, (137), 111 states have return successors, (145), 136 states have call predecessors, (145), 137 states have call successors, (145) [2024-11-14 05:05:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1599 transitions. [2024-11-14 05:05:04,361 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1599 transitions. Word has length 101 [2024-11-14 05:05:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:05:04,362 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1599 transitions. [2024-11-14 05:05:04,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-14 05:05:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1599 transitions. [2024-11-14 05:05:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-14 05:05:04,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:05:04,365 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:05:04,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:05:04,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:05:04,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:05:04,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:05:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2087503999, now seen corresponding path program 1 times [2024-11-14 05:05:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:05:04,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887402716] [2024-11-14 05:05:04,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:05:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:05:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:05:04,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 05:05:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:05:04,674 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 05:05:04,674 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 05:05:04,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 05:05:04,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:05:04,688 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:05:04,844 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:05:04,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:05:04 BoogieIcfgContainer [2024-11-14 05:05:04,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:05:04,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:05:04,852 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:05:04,852 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:05:04,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:04:50" (3/4) ... [2024-11-14 05:05:04,854 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 05:05:04,991 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 05:05:04,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:05:04,994 INFO L158 Benchmark]: Toolchain (without parser) took 16121.21ms. Allocated memory was 117.4MB in the beginning and 360.7MB in the end (delta: 243.3MB). Free memory was 91.9MB in the beginning and 274.8MB in the end (delta: -182.9MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2024-11-14 05:05:04,994 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 83.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:05:04,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.86ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 78.4MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:05:04,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.64ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:05:04,995 INFO L158 Benchmark]: Boogie Preprocessor took 31.96ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:05:04,996 INFO L158 Benchmark]: RCFGBuilder took 941.22ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 38.7MB in the end (delta: 36.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-14 05:05:04,997 INFO L158 Benchmark]: TraceAbstraction took 14551.68ms. Allocated memory was 117.4MB in the beginning and 360.7MB in the end (delta: 243.3MB). Free memory was 38.2MB in the beginning and 283.2MB in the end (delta: -245.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:05:04,998 INFO L158 Benchmark]: Witness Printer took 139.56ms. Allocated memory is still 360.7MB. Free memory was 283.2MB in the beginning and 274.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 05:05:05,000 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 83.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.86ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 78.4MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.64ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.96ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 941.22ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 38.7MB in the end (delta: 36.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14551.68ms. Allocated memory was 117.4MB in the beginning and 360.7MB in the end (delta: 243.3MB). Free memory was 38.2MB in the beginning and 283.2MB in the end (delta: -245.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 139.56ms. Allocated memory is still 360.7MB. Free memory was 283.2MB in the beginning and 274.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) [L339] COND FALSE !(T1_E == 0) [L344] COND FALSE !(T2_E == 0) [L349] COND FALSE !(E_1 == 0) [L354] COND FALSE !(E_2 == 0) [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) [L372] COND FALSE !(T1_E == 1) [L377] COND FALSE !(T2_E == 1) [L382] COND FALSE !(E_1 == 1) [L387] COND FALSE !(E_2 == 1) [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 [L136] t2_pc = 1 [L137] t2_st = 2 [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 [L262] return (__retres1); [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1852 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1825 mSDsluCounter, 3682 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1888 mSDsCounter, 337 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1567 IncrementalHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 337 mSolverCounterUnsat, 1794 mSDtfsCounter, 1567 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2261occurred in iteration=11, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 1418 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1370 ConstructedInterpolants, 0 QuantifiedInterpolants, 2635 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1079 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 514/541 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 proved your program to be incorrect! [2024-11-14 05:05:05,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4bfe310-cc5e-490e-b0f8-7b00f4b575fd/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE