./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ --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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:16:26,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:16:26,437 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:16:26,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:16:26,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:16:26,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:16:26,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:16:26,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:16:26,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:16:26,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:16:26,475 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:16:26,476 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:16:26,477 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:16:26,477 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:16:26,478 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:16:26,479 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:16:26,479 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:16:26,480 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:16:26,481 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:16:26,482 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:16:26,482 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:16:26,483 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:16:26,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:16:26,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:16:26,485 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:16:26,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:16:26,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:16:26,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:16:26,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:16:26,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:16:26,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:16:26,490 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:16:26,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:16:26,491 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:16:26,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:16:26,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:16:26,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:16:26,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:16:26,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:16:26,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:16:26,494 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:16:26,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:16:26,495 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:16:26,495 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:16:26,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:16:26,496 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2023-11-19 05:16:26,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:16:26,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:16:26,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:16:26,839 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:16:26,840 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:16:26,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/systemc/kundu1.cil.c [2023-11-19 05:16:30,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:16:30,435 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:16:30,436 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/sv-benchmarks/c/systemc/kundu1.cil.c [2023-11-19 05:16:30,447 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/data/b90b7df10/f0860eef1ec442bf941aed32266386d3/FLAG79f5bba59 [2023-11-19 05:16:30,462 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/data/b90b7df10/f0860eef1ec442bf941aed32266386d3 [2023-11-19 05:16:30,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:16:30,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:16:30,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:16:30,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:16:30,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:16:30,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e406ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30, skipping insertion in model container [2023-11-19 05:16:30,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,523 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:16:30,676 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2023-11-19 05:16:30,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:16:30,745 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:16:30,754 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2023-11-19 05:16:30,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:16:30,799 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:16:30,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30 WrapperNode [2023-11-19 05:16:30,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:16:30,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:16:30,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:16:30,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:16:30,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,848 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 258 [2023-11-19 05:16:30,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:16:30,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:16:30,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:16:30,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:16:30,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:16:30,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:16:30,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:16:30,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:16:30,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (1/1) ... [2023-11-19 05:16:30,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:16:30,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:30,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:16:30,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:16:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:16:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-19 05:16:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-19 05:16:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-19 05:16:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-19 05:16:30,972 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-19 05:16:30,974 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-19 05:16:30,975 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-19 05:16:30,975 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-19 05:16:30,975 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-19 05:16:30,975 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-19 05:16:30,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:16:30,975 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-19 05:16:30,976 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-19 05:16:30,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:16:30,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:16:31,117 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:16:31,125 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:16:31,577 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:16:31,702 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:16:31,704 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 05:16:31,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:16:31 BoogieIcfgContainer [2023-11-19 05:16:31,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:16:31,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:16:31,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:16:31,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:16:31,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:16:30" (1/3) ... [2023-11-19 05:16:31,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b1c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:16:31, skipping insertion in model container [2023-11-19 05:16:31,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:16:30" (2/3) ... [2023-11-19 05:16:31,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b1c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:16:31, skipping insertion in model container [2023-11-19 05:16:31,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:16:31" (3/3) ... [2023-11-19 05:16:31,723 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2023-11-19 05:16:31,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:16:31,747 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:16:31,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:16:31,815 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@69b50bbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:16:31,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:16:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 56 states have internal predecessors, (78), 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) [2023-11-19 05:16:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 05:16:31,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:31,831 INFO L195 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] [2023-11-19 05:16:31,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:31,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 941365448, now seen corresponding path program 1 times [2023-11-19 05:16:31,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:31,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850743907] [2023-11-19 05:16:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:31,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:32,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850743907] [2023-11-19 05:16:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850743907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:16:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3205860] [2023-11-19 05:16:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:32,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:16:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:32,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:16:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:16:32,192 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 56 states have internal predecessors, (78), 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 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 05:16:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:32,512 INFO L93 Difference]: Finished difference Result 209 states and 305 transitions. [2023-11-19 05:16:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:16:32,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-11-19 05:16:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:32,530 INFO L225 Difference]: With dead ends: 209 [2023-11-19 05:16:32,530 INFO L226 Difference]: Without dead ends: 135 [2023-11-19 05:16:32,536 INFO L412 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 [2023-11-19 05:16:32,545 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 177 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:32,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 264 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:16:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-19 05:16:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2023-11-19 05:16:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 96 states have internal predecessors, (133), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-19 05:16:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 176 transitions. [2023-11-19 05:16:32,630 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 176 transitions. Word has length 34 [2023-11-19 05:16:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:32,631 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 176 transitions. [2023-11-19 05:16:32,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 05:16:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 176 transitions. [2023-11-19 05:16:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 05:16:32,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:32,635 INFO L195 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] [2023-11-19 05:16:32,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:16:32,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:32,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:32,637 INFO L85 PathProgramCache]: Analyzing trace with hash -649029529, now seen corresponding path program 1 times [2023-11-19 05:16:32,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061951205] [2023-11-19 05:16:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:32,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061951205] [2023-11-19 05:16:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061951205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:16:32,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460503408] [2023-11-19 05:16:32,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:32,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:16:32,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:32,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:16:32,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:16:32,781 INFO L87 Difference]: Start difference. First operand 127 states and 176 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 05:16:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:33,084 INFO L93 Difference]: Finished difference Result 366 states and 507 transitions. [2023-11-19 05:16:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:16:33,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-11-19 05:16:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:33,095 INFO L225 Difference]: With dead ends: 366 [2023-11-19 05:16:33,095 INFO L226 Difference]: Without dead ends: 244 [2023-11-19 05:16:33,097 INFO L412 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 [2023-11-19 05:16:33,099 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 169 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:33,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 236 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:16:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-11-19 05:16:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 225. [2023-11-19 05:16:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 165 states have (on average 1.3636363636363635) internal successors, (225), 168 states have internal predecessors, (225), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-19 05:16:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 300 transitions. [2023-11-19 05:16:33,141 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 300 transitions. Word has length 34 [2023-11-19 05:16:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:33,142 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 300 transitions. [2023-11-19 05:16:33,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 05:16:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 300 transitions. [2023-11-19 05:16:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 05:16:33,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:33,144 INFO L195 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] [2023-11-19 05:16:33,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:16:33,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:33,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash 837489357, now seen corresponding path program 1 times [2023-11-19 05:16:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:33,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372393025] [2023-11-19 05:16:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:33,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372393025] [2023-11-19 05:16:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372393025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:33,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:33,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:16:33,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357085903] [2023-11-19 05:16:33,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:33,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:16:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:16:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:16:33,420 INFO L87 Difference]: Start difference. First operand 225 states and 300 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 05:16:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:33,552 INFO L93 Difference]: Finished difference Result 506 states and 678 transitions. [2023-11-19 05:16:33,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:16:33,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2023-11-19 05:16:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:33,563 INFO L225 Difference]: With dead ends: 506 [2023-11-19 05:16:33,569 INFO L226 Difference]: Without dead ends: 334 [2023-11-19 05:16:33,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:16:33,575 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 69 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:33,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 244 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:16:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-11-19 05:16:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 328. [2023-11-19 05:16:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 242 states have (on average 1.3636363636363635) internal successors, (330), 245 states have internal predecessors, (330), 55 states have call successors, (55), 31 states have call predecessors, (55), 30 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-19 05:16:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 437 transitions. [2023-11-19 05:16:33,646 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 437 transitions. Word has length 35 [2023-11-19 05:16:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:33,647 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 437 transitions. [2023-11-19 05:16:33,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 05:16:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 437 transitions. [2023-11-19 05:16:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-19 05:16:33,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:33,650 INFO L195 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, 1, 1, 1, 1, 1, 1] [2023-11-19 05:16:33,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:16:33,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:33,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1822212729, now seen corresponding path program 1 times [2023-11-19 05:16:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394414903] [2023-11-19 05:16:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:33,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394414903] [2023-11-19 05:16:33,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394414903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:33,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:33,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:16:33,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061089698] [2023-11-19 05:16:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:33,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:16:33,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:16:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:16:33,747 INFO L87 Difference]: Start difference. First operand 328 states and 437 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 05:16:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:33,898 INFO L93 Difference]: Finished difference Result 509 states and 680 transitions. [2023-11-19 05:16:33,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:16:33,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2023-11-19 05:16:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:33,905 INFO L225 Difference]: With dead ends: 509 [2023-11-19 05:16:33,905 INFO L226 Difference]: Without dead ends: 392 [2023-11-19 05:16:33,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:16:33,908 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 149 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:33,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 182 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:16:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-19 05:16:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 383. [2023-11-19 05:16:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 284 states have (on average 1.3626760563380282) internal successors, (387), 287 states have internal predecessors, (387), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-19 05:16:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 510 transitions. [2023-11-19 05:16:33,964 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 510 transitions. Word has length 43 [2023-11-19 05:16:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:33,965 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 510 transitions. [2023-11-19 05:16:33,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 05:16:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 510 transitions. [2023-11-19 05:16:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-19 05:16:33,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:33,976 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:16:33,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:16:33,976 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:33,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1463036128, now seen corresponding path program 1 times [2023-11-19 05:16:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820238749] [2023-11-19 05:16:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:16:34,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:34,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820238749] [2023-11-19 05:16:34,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820238749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:34,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:34,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:16:34,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719911011] [2023-11-19 05:16:34,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:34,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:16:34,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:34,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:16:34,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:16:34,213 INFO L87 Difference]: Start difference. First operand 383 states and 510 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 05:16:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:34,416 INFO L93 Difference]: Finished difference Result 834 states and 1111 transitions. [2023-11-19 05:16:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:16:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2023-11-19 05:16:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:34,421 INFO L225 Difference]: With dead ends: 834 [2023-11-19 05:16:34,422 INFO L226 Difference]: Without dead ends: 556 [2023-11-19 05:16:34,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:16:34,425 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 204 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:34,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 338 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:16:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-11-19 05:16:34,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 539. [2023-11-19 05:16:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 401 states have (on average 1.3591022443890275) internal successors, (545), 404 states have internal predecessors, (545), 87 states have call successors, (87), 51 states have call predecessors, (87), 50 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2023-11-19 05:16:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 716 transitions. [2023-11-19 05:16:34,481 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 716 transitions. Word has length 46 [2023-11-19 05:16:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:34,482 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 716 transitions. [2023-11-19 05:16:34,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-19 05:16:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 716 transitions. [2023-11-19 05:16:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-19 05:16:34,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:34,484 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 05:16:34,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:16:34,485 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:34,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:34,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1096993177, now seen corresponding path program 1 times [2023-11-19 05:16:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717076623] [2023-11-19 05:16:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:34,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 05:16:34,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:34,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717076623] [2023-11-19 05:16:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717076623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:34,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:34,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:16:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407617618] [2023-11-19 05:16:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:34,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:16:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:16:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:16:34,713 INFO L87 Difference]: Start difference. First operand 539 states and 716 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 05:16:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:35,078 INFO L93 Difference]: Finished difference Result 1549 states and 2043 transitions. [2023-11-19 05:16:35,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:16:35,079 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2023-11-19 05:16:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:35,088 INFO L225 Difference]: With dead ends: 1549 [2023-11-19 05:16:35,088 INFO L226 Difference]: Without dead ends: 1016 [2023-11-19 05:16:35,090 INFO L412 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 [2023-11-19 05:16:35,091 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 180 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:35,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 210 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:16:35,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2023-11-19 05:16:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 992. [2023-11-19 05:16:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 724 states have (on average 1.3342541436464088) internal successors, (966), 727 states have internal predecessors, (966), 167 states have call successors, (167), 101 states have call predecessors, (167), 100 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2023-11-19 05:16:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1297 transitions. [2023-11-19 05:16:35,215 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1297 transitions. Word has length 48 [2023-11-19 05:16:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:35,216 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1297 transitions. [2023-11-19 05:16:35,216 INFO L496 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-19 05:16:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1297 transitions. [2023-11-19 05:16:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-19 05:16:35,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:35,218 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 05:16:35,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:16:35,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:35,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1973261035, now seen corresponding path program 1 times [2023-11-19 05:16:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:35,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332353279] [2023-11-19 05:16:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 05:16:35,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332353279] [2023-11-19 05:16:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332353279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:16:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364236246] [2023-11-19 05:16:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:35,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:16:35,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:16:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:16:35,279 INFO L87 Difference]: Start difference. First operand 992 states and 1297 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 05:16:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:35,498 INFO L93 Difference]: Finished difference Result 2491 states and 3230 transitions. [2023-11-19 05:16:35,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:16:35,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2023-11-19 05:16:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:35,509 INFO L225 Difference]: With dead ends: 2491 [2023-11-19 05:16:35,510 INFO L226 Difference]: Without dead ends: 1505 [2023-11-19 05:16:35,512 INFO L412 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 [2023-11-19 05:16:35,513 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 42 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:35,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2023-11-19 05:16:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1235. [2023-11-19 05:16:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 923 states have (on average 1.333694474539545) internal successors, (1231), 927 states have internal predecessors, (1231), 189 states have call successors, (189), 123 states have call predecessors, (189), 122 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) [2023-11-19 05:16:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1606 transitions. [2023-11-19 05:16:35,669 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1606 transitions. Word has length 49 [2023-11-19 05:16:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:35,669 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1606 transitions. [2023-11-19 05:16:35,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 05:16:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1606 transitions. [2023-11-19 05:16:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-19 05:16:35,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:35,672 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-19 05:16:35,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:16:35,672 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:35,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash -356890693, now seen corresponding path program 1 times [2023-11-19 05:16:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:35,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130065795] [2023-11-19 05:16:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 05:16:35,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:35,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130065795] [2023-11-19 05:16:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130065795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:35,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:35,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:16:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442161585] [2023-11-19 05:16:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:35,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:16:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:16:35,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:16:35,731 INFO L87 Difference]: Start difference. First operand 1235 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 05:16:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:35,978 INFO L93 Difference]: Finished difference Result 2860 states and 3725 transitions. [2023-11-19 05:16:35,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:16:35,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2023-11-19 05:16:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:35,989 INFO L225 Difference]: With dead ends: 2860 [2023-11-19 05:16:35,990 INFO L226 Difference]: Without dead ends: 1631 [2023-11-19 05:16:35,993 INFO L412 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 [2023-11-19 05:16:35,994 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 42 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:35,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 193 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2023-11-19 05:16:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1437. [2023-11-19 05:16:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1085 states have (on average 1.335483870967742) internal successors, (1449), 1089 states have internal predecessors, (1449), 209 states have call successors, (209), 143 states have call predecessors, (209), 142 states have return successors, (206), 205 states have call predecessors, (206), 206 states have call successors, (206) [2023-11-19 05:16:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1864 transitions. [2023-11-19 05:16:36,154 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1864 transitions. Word has length 50 [2023-11-19 05:16:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:36,154 INFO L495 AbstractCegarLoop]: Abstraction has 1437 states and 1864 transitions. [2023-11-19 05:16:36,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 05:16:36,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1864 transitions. [2023-11-19 05:16:36,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-19 05:16:36,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:36,158 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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] [2023-11-19 05:16:36,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:16:36,158 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:36,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash -163666461, now seen corresponding path program 1 times [2023-11-19 05:16:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:36,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256599989] [2023-11-19 05:16:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 05:16:36,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:36,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256599989] [2023-11-19 05:16:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256599989] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:36,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273227542] [2023-11-19 05:16:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:36,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:36,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:36,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:16:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:36,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 05:16:36,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 05:16:36,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:16:36,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273227542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 05:16:36,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [12] total 13 [2023-11-19 05:16:36,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995976094] [2023-11-19 05:16:36,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:16:36,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:16:36,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-19 05:16:36,952 INFO L87 Difference]: Start difference. First operand 1437 states and 1864 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:37,215 INFO L93 Difference]: Finished difference Result 3838 states and 4994 transitions. [2023-11-19 05:16:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:16:37,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2023-11-19 05:16:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:37,234 INFO L225 Difference]: With dead ends: 3838 [2023-11-19 05:16:37,234 INFO L226 Difference]: Without dead ends: 2828 [2023-11-19 05:16:37,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-19 05:16:37,238 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 49 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:37,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 171 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2023-11-19 05:16:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2815. [2023-11-19 05:16:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2143 states have (on average 1.333177788147457) internal successors, (2857), 2147 states have internal predecessors, (2857), 389 states have call successors, (389), 283 states have call predecessors, (389), 282 states have return successors, (386), 385 states have call predecessors, (386), 386 states have call successors, (386) [2023-11-19 05:16:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3632 transitions. [2023-11-19 05:16:37,503 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3632 transitions. Word has length 88 [2023-11-19 05:16:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:37,503 INFO L495 AbstractCegarLoop]: Abstraction has 2815 states and 3632 transitions. [2023-11-19 05:16:37,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3632 transitions. [2023-11-19 05:16:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-19 05:16:37,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:37,507 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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] [2023-11-19 05:16:37,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:16:37,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:37,729 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:37,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1928483070, now seen corresponding path program 1 times [2023-11-19 05:16:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805160388] [2023-11-19 05:16:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 05:16:38,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805160388] [2023-11-19 05:16:38,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805160388] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:38,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138826505] [2023-11-19 05:16:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:38,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:38,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:38,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:38,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:16:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:38,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 05:16:38,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 05:16:38,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:16:38,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138826505] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:38,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 05:16:38,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2023-11-19 05:16:38,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720482545] [2023-11-19 05:16:38,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:38,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:16:38,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:38,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:16:38,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-19 05:16:38,377 INFO L87 Difference]: Start difference. First operand 2815 states and 3632 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-19 05:16:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:38,626 INFO L93 Difference]: Finished difference Result 4830 states and 6297 transitions. [2023-11-19 05:16:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:16:38,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 88 [2023-11-19 05:16:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:38,645 INFO L225 Difference]: With dead ends: 4830 [2023-11-19 05:16:38,646 INFO L226 Difference]: Without dead ends: 2843 [2023-11-19 05:16:38,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-19 05:16:38,652 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 68 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:38,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 220 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2023-11-19 05:16:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2815. [2023-11-19 05:16:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2143 states have (on average 1.3201119925338312) internal successors, (2829), 2147 states have internal predecessors, (2829), 389 states have call successors, (389), 283 states have call predecessors, (389), 282 states have return successors, (386), 385 states have call predecessors, (386), 386 states have call successors, (386) [2023-11-19 05:16:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3604 transitions. [2023-11-19 05:16:38,923 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3604 transitions. Word has length 88 [2023-11-19 05:16:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:38,923 INFO L495 AbstractCegarLoop]: Abstraction has 2815 states and 3604 transitions. [2023-11-19 05:16:38,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-19 05:16:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3604 transitions. [2023-11-19 05:16:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-19 05:16:38,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:38,927 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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, 1, 1] [2023-11-19 05:16:38,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:16:39,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-19 05:16:39,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:39,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:39,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1062438256, now seen corresponding path program 1 times [2023-11-19 05:16:39,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191736021] [2023-11-19 05:16:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-19 05:16:39,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:39,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191736021] [2023-11-19 05:16:39,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191736021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:39,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727562504] [2023-11-19 05:16:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:39,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:39,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:39,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:39,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:16:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:39,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 05:16:39,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 05:16:39,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:16:39,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727562504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:39,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 05:16:39,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-19 05:16:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431025706] [2023-11-19 05:16:39,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:39,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:16:39,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:39,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:16:39,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:16:39,491 INFO L87 Difference]: Start difference. First operand 2815 states and 3604 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:39,698 INFO L93 Difference]: Finished difference Result 4816 states and 6236 transitions. [2023-11-19 05:16:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:16:39,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2023-11-19 05:16:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:39,717 INFO L225 Difference]: With dead ends: 4816 [2023-11-19 05:16:39,717 INFO L226 Difference]: Without dead ends: 2815 [2023-11-19 05:16:39,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:16:39,724 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:39,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 82 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2023-11-19 05:16:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2815. [2023-11-19 05:16:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2143 states have (on average 1.3070461969202054) internal successors, (2801), 2147 states have internal predecessors, (2801), 389 states have call successors, (389), 283 states have call predecessors, (389), 282 states have return successors, (386), 385 states have call predecessors, (386), 386 states have call successors, (386) [2023-11-19 05:16:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3576 transitions. [2023-11-19 05:16:39,985 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3576 transitions. Word has length 88 [2023-11-19 05:16:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:39,985 INFO L495 AbstractCegarLoop]: Abstraction has 2815 states and 3576 transitions. [2023-11-19 05:16:39,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3576 transitions. [2023-11-19 05:16:39,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-19 05:16:39,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:39,988 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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] [2023-11-19 05:16:40,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:16:40,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:40,204 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:40,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1531735505, now seen corresponding path program 1 times [2023-11-19 05:16:40,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:40,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246819903] [2023-11-19 05:16:40,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:40,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 05:16:40,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246819903] [2023-11-19 05:16:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246819903] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:40,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827670464] [2023-11-19 05:16:40,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:40,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:40,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:40,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:16:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:40,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-19 05:16:40,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 05:16:40,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:16:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-19 05:16:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827670464] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:16:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1574427058] [2023-11-19 05:16:41,042 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2023-11-19 05:16:41,043 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:16:41,047 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:16:41,052 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:16:41,053 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:16:44,701 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 57 for LOIs [2023-11-19 05:16:44,719 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 68 for LOIs [2023-11-19 05:16:44,787 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 72 for LOIs [2023-11-19 05:16:44,843 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 72 for LOIs [2023-11-19 05:16:44,891 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 50 for LOIs [2023-11-19 05:16:44,965 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 79 for LOIs [2023-11-19 05:16:45,197 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:16:50,281 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '50126#(and (<= 1 |#StackHeapBarrier|) (<= 0 ~data_0~0) (= ~i~0 0) (= ~e~0 0) (= ~P_1_ev~0 0) (= ~P_1_st~0 1) (= ~C_1_pr~0 0) (exists ((|v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_1| 0)) (<= |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_1| 1) (<= 0 |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_1|))) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= ~C_1_pc~0 0) (exists ((|v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_1| Int)) (and (<= |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_1| 2147483647) (not (= |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_1| 0)) (<= 0 (+ |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_1| 2147483648)))) (<= 0 ~P_1_pc~0) (not (= ~num~0 0)) (<= 0 ~num~0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (not (= ~num~0 1)) (= ~timer~0 0) (= ~C_1_i~0 1))' at error location [2023-11-19 05:16:50,282 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:16:50,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:16:50,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 5] total 15 [2023-11-19 05:16:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481804121] [2023-11-19 05:16:50,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:16:50,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-19 05:16:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:50,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 05:16:50,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1921, Unknown=0, NotChecked=0, Total=2162 [2023-11-19 05:16:50,286 INFO L87 Difference]: Start difference. First operand 2815 states and 3576 transitions. Second operand has 15 states, 13 states have (on average 8.692307692307692) internal successors, (113), 13 states have internal predecessors, (113), 5 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 5 states have call successors, (37) [2023-11-19 05:16:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:53,831 INFO L93 Difference]: Finished difference Result 7703 states and 10461 transitions. [2023-11-19 05:16:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-11-19 05:16:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.692307692307692) internal successors, (113), 13 states have internal predecessors, (113), 5 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 5 states have call successors, (37) Word has length 89 [2023-11-19 05:16:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:53,866 INFO L225 Difference]: With dead ends: 7703 [2023-11-19 05:16:53,866 INFO L226 Difference]: Without dead ends: 4894 [2023-11-19 05:16:53,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 234 SyntacticMatches, 9 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7967 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1869, Invalid=17313, Unknown=0, NotChecked=0, Total=19182 [2023-11-19 05:16:53,882 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 1247 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:53,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 935 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 05:16:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4894 states. [2023-11-19 05:16:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4894 to 2647. [2023-11-19 05:16:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2095 states have (on average 1.3164677804295943) internal successors, (2758), 2097 states have internal predecessors, (2758), 307 states have call successors, (307), 245 states have call predecessors, (307), 244 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) [2023-11-19 05:16:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3369 transitions. [2023-11-19 05:16:54,290 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3369 transitions. Word has length 89 [2023-11-19 05:16:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:54,291 INFO L495 AbstractCegarLoop]: Abstraction has 2647 states and 3369 transitions. [2023-11-19 05:16:54,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.692307692307692) internal successors, (113), 13 states have internal predecessors, (113), 5 states have call successors, (37), 5 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 5 states have call successors, (37) [2023-11-19 05:16:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3369 transitions. [2023-11-19 05:16:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-19 05:16:54,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:54,293 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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, 1] [2023-11-19 05:16:54,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-19 05:16:54,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-19 05:16:54,508 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:54,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1843436301, now seen corresponding path program 1 times [2023-11-19 05:16:54,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:54,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32140152] [2023-11-19 05:16:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-19 05:16:54,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32140152] [2023-11-19 05:16:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32140152] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498620447] [2023-11-19 05:16:54,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:54,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:54,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:54,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:54,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 05:16:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:54,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 05:16:54,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-19 05:16:54,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:16:54,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498620447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:54,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 05:16:54,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-11-19 05:16:54,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713820392] [2023-11-19 05:16:54,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:54,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:16:54,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:54,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:16:54,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:16:54,830 INFO L87 Difference]: Start difference. First operand 2647 states and 3369 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:55,084 INFO L93 Difference]: Finished difference Result 4649 states and 5940 transitions. [2023-11-19 05:16:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:16:55,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2023-11-19 05:16:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:55,100 INFO L225 Difference]: With dead ends: 4649 [2023-11-19 05:16:55,101 INFO L226 Difference]: Without dead ends: 2652 [2023-11-19 05:16:55,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:16:55,106 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:55,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 169 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2023-11-19 05:16:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2647. [2023-11-19 05:16:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2095 states have (on average 1.3121718377088305) internal successors, (2749), 2097 states have internal predecessors, (2749), 307 states have call successors, (307), 245 states have call predecessors, (307), 244 states have return successors, (304), 304 states have call predecessors, (304), 304 states have call successors, (304) [2023-11-19 05:16:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3360 transitions. [2023-11-19 05:16:55,398 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3360 transitions. Word has length 89 [2023-11-19 05:16:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:55,399 INFO L495 AbstractCegarLoop]: Abstraction has 2647 states and 3360 transitions. [2023-11-19 05:16:55,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3360 transitions. [2023-11-19 05:16:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-19 05:16:55,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:55,401 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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] [2023-11-19 05:16:55,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 05:16:55,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:55,621 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:55,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 822880722, now seen corresponding path program 1 times [2023-11-19 05:16:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840530522] [2023-11-19 05:16:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-19 05:16:55,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:55,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840530522] [2023-11-19 05:16:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840530522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:55,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452116846] [2023-11-19 05:16:55,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:55,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:55,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:55,743 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:55,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 05:16:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:55,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 05:16:55,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 05:16:55,863 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 05:16:55,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452116846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:55,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 05:16:55,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-19 05:16:55,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017099375] [2023-11-19 05:16:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:55,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:16:55,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:16:55,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:16:55,865 INFO L87 Difference]: Start difference. First operand 2647 states and 3360 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-19 05:16:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:56,219 INFO L93 Difference]: Finished difference Result 5812 states and 7448 transitions. [2023-11-19 05:16:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:16:56,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 89 [2023-11-19 05:16:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:56,242 INFO L225 Difference]: With dead ends: 5812 [2023-11-19 05:16:56,242 INFO L226 Difference]: Without dead ends: 3815 [2023-11-19 05:16:56,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:16:56,248 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:56,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 212 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2023-11-19 05:16:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3663. [2023-11-19 05:16:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3663 states, 2860 states have (on average 1.2923076923076924) internal successors, (3696), 2862 states have internal predecessors, (3696), 450 states have call successors, (450), 353 states have call predecessors, (450), 352 states have return successors, (468), 447 states have call predecessors, (468), 447 states have call successors, (468) [2023-11-19 05:16:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3663 states and 4614 transitions. [2023-11-19 05:16:56,671 INFO L78 Accepts]: Start accepts. Automaton has 3663 states and 4614 transitions. Word has length 89 [2023-11-19 05:16:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:56,672 INFO L495 AbstractCegarLoop]: Abstraction has 3663 states and 4614 transitions. [2023-11-19 05:16:56,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-19 05:16:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3663 states and 4614 transitions. [2023-11-19 05:16:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-19 05:16:56,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:56,675 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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] [2023-11-19 05:16:56,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 05:16:56,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-19 05:16:56,888 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:56,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash 815957492, now seen corresponding path program 1 times [2023-11-19 05:16:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:56,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901942857] [2023-11-19 05:16:56,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:56,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-19 05:16:56,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901942857] [2023-11-19 05:16:56,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901942857] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870630059] [2023-11-19 05:16:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:56,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:16:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:16:56,995 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:16:57,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-19 05:16:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:57,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-19 05:16:57,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:16:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 05:16:57,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:16:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-19 05:16:57,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870630059] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 05:16:57,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:16:57,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 7] total 14 [2023-11-19 05:16:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818970939] [2023-11-19 05:16:57,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:57,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:16:57,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:57,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:16:57,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-11-19 05:16:57,415 INFO L87 Difference]: Start difference. First operand 3663 states and 4614 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:57,802 INFO L93 Difference]: Finished difference Result 6330 states and 8020 transitions. [2023-11-19 05:16:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:16:57,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2023-11-19 05:16:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:57,837 INFO L225 Difference]: With dead ends: 6330 [2023-11-19 05:16:57,837 INFO L226 Difference]: Without dead ends: 2689 [2023-11-19 05:16:57,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-11-19 05:16:57,848 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:57,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 198 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:16:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2023-11-19 05:16:58,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2418. [2023-11-19 05:16:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 1791 states have (on average 1.2596314907872697) internal successors, (2256), 1799 states have internal predecessors, (2256), 371 states have call successors, (371), 250 states have call predecessors, (371), 255 states have return successors, (419), 368 states have call predecessors, (419), 368 states have call successors, (419) [2023-11-19 05:16:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3046 transitions. [2023-11-19 05:16:58,144 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3046 transitions. Word has length 90 [2023-11-19 05:16:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:58,144 INFO L495 AbstractCegarLoop]: Abstraction has 2418 states and 3046 transitions. [2023-11-19 05:16:58,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3046 transitions. [2023-11-19 05:16:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-19 05:16:58,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:58,148 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:16:58,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-19 05:16:58,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-19 05:16:58,372 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:58,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1925315183, now seen corresponding path program 1 times [2023-11-19 05:16:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838469743] [2023-11-19 05:16:58,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-19 05:16:58,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:58,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838469743] [2023-11-19 05:16:58,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838469743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:58,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:58,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:16:58,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268892290] [2023-11-19 05:16:58,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:58,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:16:58,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:58,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:16:58,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:16:58,429 INFO L87 Difference]: Start difference. First operand 2418 states and 3046 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-19 05:16:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:58,690 INFO L93 Difference]: Finished difference Result 3421 states and 4346 transitions. [2023-11-19 05:16:58,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:16:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 98 [2023-11-19 05:16:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:58,697 INFO L225 Difference]: With dead ends: 3421 [2023-11-19 05:16:58,697 INFO L226 Difference]: Without dead ends: 1512 [2023-11-19 05:16:58,702 INFO L412 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 [2023-11-19 05:16:58,703 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 151 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:58,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 219 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:16:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2023-11-19 05:16:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1509. [2023-11-19 05:16:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1119 states have (on average 1.225201072386059) internal successors, (1371), 1124 states have internal predecessors, (1371), 227 states have call successors, (227), 159 states have call predecessors, (227), 162 states have return successors, (241), 225 states have call predecessors, (241), 225 states have call successors, (241) [2023-11-19 05:16:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1839 transitions. [2023-11-19 05:16:58,874 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1839 transitions. Word has length 98 [2023-11-19 05:16:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:58,874 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1839 transitions. [2023-11-19 05:16:58,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-19 05:16:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1839 transitions. [2023-11-19 05:16:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-19 05:16:58,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:58,877 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:16:58,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 05:16:58,877 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:58,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1359641630, now seen corresponding path program 1 times [2023-11-19 05:16:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955854071] [2023-11-19 05:16:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-19 05:16:58,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955854071] [2023-11-19 05:16:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955854071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:16:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246307059] [2023-11-19 05:16:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:58,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:16:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:16:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:16:58,963 INFO L87 Difference]: Start difference. First operand 1509 states and 1839 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:59,222 INFO L93 Difference]: Finished difference Result 2492 states and 3069 transitions. [2023-11-19 05:16:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:16:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2023-11-19 05:16:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:59,228 INFO L225 Difference]: With dead ends: 2492 [2023-11-19 05:16:59,229 INFO L226 Difference]: Without dead ends: 1649 [2023-11-19 05:16:59,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:16:59,232 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 61 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:59,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 256 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:16:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2023-11-19 05:16:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1636. [2023-11-19 05:16:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1212 states have (on average 1.221947194719472) internal successors, (1481), 1218 states have internal predecessors, (1481), 247 states have call successors, (247), 172 states have call predecessors, (247), 176 states have return successors, (265), 245 states have call predecessors, (265), 245 states have call successors, (265) [2023-11-19 05:16:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 1993 transitions. [2023-11-19 05:16:59,422 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 1993 transitions. Word has length 99 [2023-11-19 05:16:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:16:59,423 INFO L495 AbstractCegarLoop]: Abstraction has 1636 states and 1993 transitions. [2023-11-19 05:16:59,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1993 transitions. [2023-11-19 05:16:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-19 05:16:59,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:16:59,428 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2023-11-19 05:16:59,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 05:16:59,428 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:16:59,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:16:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1320655986, now seen corresponding path program 1 times [2023-11-19 05:16:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:16:59,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878644556] [2023-11-19 05:16:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:16:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:16:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:16:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-11-19 05:16:59,570 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:16:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878644556] [2023-11-19 05:16:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878644556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:16:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:16:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:16:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209154054] [2023-11-19 05:16:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:16:59,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:16:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:16:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:16:59,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:16:59,574 INFO L87 Difference]: Start difference. First operand 1636 states and 1993 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:16:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:16:59,783 INFO L93 Difference]: Finished difference Result 1957 states and 2370 transitions. [2023-11-19 05:16:59,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:16:59,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 146 [2023-11-19 05:16:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:16:59,789 INFO L225 Difference]: With dead ends: 1957 [2023-11-19 05:16:59,789 INFO L226 Difference]: Without dead ends: 1297 [2023-11-19 05:16:59,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:16:59,793 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:16:59,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 147 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:16:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2023-11-19 05:17:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1297. [2023-11-19 05:17:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 964 states have (on average 1.2261410788381744) internal successors, (1182), 970 states have internal predecessors, (1182), 194 states have call successors, (194), 134 states have call predecessors, (194), 138 states have return successors, (212), 192 states have call predecessors, (212), 192 states have call successors, (212) [2023-11-19 05:17:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1588 transitions. [2023-11-19 05:17:00,006 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1588 transitions. Word has length 146 [2023-11-19 05:17:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:17:00,007 INFO L495 AbstractCegarLoop]: Abstraction has 1297 states and 1588 transitions. [2023-11-19 05:17:00,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-19 05:17:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1588 transitions. [2023-11-19 05:17:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-19 05:17:00,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:17:00,011 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2023-11-19 05:17:00,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 05:17:00,011 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:17:00,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:17:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1725996742, now seen corresponding path program 1 times [2023-11-19 05:17:00,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:17:00,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739413907] [2023-11-19 05:17:00,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:17:00,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:17:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:17:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-11-19 05:17:00,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:17:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739413907] [2023-11-19 05:17:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739413907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:17:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:17:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:17:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187028204] [2023-11-19 05:17:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:17:00,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:17:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:17:00,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:17:00,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:17:00,071 INFO L87 Difference]: Start difference. First operand 1297 states and 1588 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-19 05:17:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:17:00,282 INFO L93 Difference]: Finished difference Result 3060 states and 3739 transitions. [2023-11-19 05:17:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:17:00,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 157 [2023-11-19 05:17:00,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:17:00,287 INFO L225 Difference]: With dead ends: 3060 [2023-11-19 05:17:00,288 INFO L226 Difference]: Without dead ends: 1785 [2023-11-19 05:17:00,291 INFO L412 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 [2023-11-19 05:17:00,292 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:17:00,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:17:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2023-11-19 05:17:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1311. [2023-11-19 05:17:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 976 states have (on average 1.2254098360655739) internal successors, (1196), 982 states have internal predecessors, (1196), 195 states have call successors, (195), 135 states have call predecessors, (195), 139 states have return successors, (213), 193 states have call predecessors, (213), 193 states have call successors, (213) [2023-11-19 05:17:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1604 transitions. [2023-11-19 05:17:00,451 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1604 transitions. Word has length 157 [2023-11-19 05:17:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:17:00,452 INFO L495 AbstractCegarLoop]: Abstraction has 1311 states and 1604 transitions. [2023-11-19 05:17:00,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-19 05:17:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1604 transitions. [2023-11-19 05:17:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-19 05:17:00,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:17:00,456 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 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] [2023-11-19 05:17:00,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 05:17:00,457 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:17:00,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:17:00,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2115846531, now seen corresponding path program 1 times [2023-11-19 05:17:00,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:17:00,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487084754] [2023-11-19 05:17:00,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:17:00,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:17:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:17:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 77 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-11-19 05:17:00,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:17:00,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487084754] [2023-11-19 05:17:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487084754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:17:00,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106640470] [2023-11-19 05:17:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:17:00,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:17:00,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:17:00,736 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:17:00,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-19 05:17:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:17:00,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-19 05:17:00,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:17:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 128 proven. 26 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2023-11-19 05:17:00,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:17:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2023-11-19 05:17:01,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106640470] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 05:17:01,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:17:01,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 7] total 11 [2023-11-19 05:17:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111209557] [2023-11-19 05:17:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:17:01,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:17:01,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:17:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:17:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-11-19 05:17:01,139 INFO L87 Difference]: Start difference. First operand 1311 states and 1604 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 05:17:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:17:01,494 INFO L93 Difference]: Finished difference Result 2928 states and 3686 transitions. [2023-11-19 05:17:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:17:01,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2023-11-19 05:17:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:17:01,501 INFO L225 Difference]: With dead ends: 2928 [2023-11-19 05:17:01,502 INFO L226 Difference]: Without dead ends: 1604 [2023-11-19 05:17:01,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:17:01,507 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 58 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:17:01,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 232 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:17:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2023-11-19 05:17:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1523. [2023-11-19 05:17:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1067 states have (on average 1.190253045923149) internal successors, (1270), 1096 states have internal predecessors, (1270), 272 states have call successors, (272), 166 states have call predecessors, (272), 183 states have return successors, (402), 260 states have call predecessors, (402), 270 states have call successors, (402) [2023-11-19 05:17:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1944 transitions. [2023-11-19 05:17:01,719 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1944 transitions. Word has length 158 [2023-11-19 05:17:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:17:01,721 INFO L495 AbstractCegarLoop]: Abstraction has 1523 states and 1944 transitions. [2023-11-19 05:17:01,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-19 05:17:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1944 transitions. [2023-11-19 05:17:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-19 05:17:01,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:17:01,727 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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] [2023-11-19 05:17:01,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-19 05:17:01,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:17:01,948 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:17:01,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:17:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash -373775186, now seen corresponding path program 1 times [2023-11-19 05:17:01,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:17:01,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999857883] [2023-11-19 05:17:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:17:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:17:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:17:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 84 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-11-19 05:17:02,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:17:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999857883] [2023-11-19 05:17:02,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999857883] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:17:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323852459] [2023-11-19 05:17:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:17:02,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:17:02,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:17:02,107 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:17:02,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-19 05:17:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:17:02,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 05:17:02,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:17:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-19 05:17:02,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:17:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-11-19 05:17:02,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323852459] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 05:17:02,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:17:02,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 7 [2023-11-19 05:17:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811171597] [2023-11-19 05:17:02,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:17:02,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:17:02,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:17:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:17:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:17:02,399 INFO L87 Difference]: Start difference. First operand 1523 states and 1944 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 05:17:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:17:02,639 INFO L93 Difference]: Finished difference Result 2827 states and 3650 transitions. [2023-11-19 05:17:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:17:02,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 169 [2023-11-19 05:17:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:17:02,646 INFO L225 Difference]: With dead ends: 2827 [2023-11-19 05:17:02,646 INFO L226 Difference]: Without dead ends: 1544 [2023-11-19 05:17:02,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:17:02,652 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:17:02,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 154 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:17:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2023-11-19 05:17:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1531. [2023-11-19 05:17:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1087 states have (on average 1.1793928242870286) internal successors, (1282), 1108 states have internal predecessors, (1282), 259 states have call successors, (259), 175 states have call predecessors, (259), 184 states have return successors, (287), 247 states have call predecessors, (287), 257 states have call successors, (287) [2023-11-19 05:17:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1828 transitions. [2023-11-19 05:17:02,856 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1828 transitions. Word has length 169 [2023-11-19 05:17:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:17:02,857 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 1828 transitions. [2023-11-19 05:17:02,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-19 05:17:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1828 transitions. [2023-11-19 05:17:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-19 05:17:02,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:17:02,863 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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, 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] [2023-11-19 05:17:02,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-19 05:17:03,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-19 05:17:03,076 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:17:03,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:17:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1511090013, now seen corresponding path program 1 times [2023-11-19 05:17:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:17:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128355346] [2023-11-19 05:17:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:17:03,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:17:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:17:03,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 05:17:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:17:03,226 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 05:17:03,226 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 05:17:03,227 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 05:17:03,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 05:17:03,233 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:17:03,238 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:17:03,339 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-19 05:17:03,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-19 05:17:03,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,363 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,366 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-19 05:17:03,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-19 05:17:03,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:17:03 BoogieIcfgContainer [2023-11-19 05:17:03,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:17:03,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:17:03,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:17:03,413 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:17:03,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:16:31" (3/4) ... [2023-11-19 05:17:03,414 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 05:17:03,440 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,441 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,442 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,443 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-19 05:17:03,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-19 05:17:03,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-19 05:17:03,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-19 05:17:03,448 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:17:03,542 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 05:17:03,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:17:03,543 INFO L158 Benchmark]: Toolchain (without parser) took 33075.78ms. Allocated memory was 132.1MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 92.9MB in the beginning and 400.1MB in the end (delta: -307.2MB). Peak memory consumption was 566.5MB. Max. memory is 16.1GB. [2023-11-19 05:17:03,543 INFO L158 Benchmark]: CDTParser took 1.31ms. Allocated memory is still 132.1MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:17:03,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.33ms. Allocated memory is still 132.1MB. Free memory was 92.4MB in the beginning and 79.1MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 05:17:03,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.28ms. Allocated memory is still 132.1MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:17:03,544 INFO L158 Benchmark]: Boogie Preprocessor took 34.32ms. Allocated memory is still 132.1MB. Free memory was 77.0MB in the beginning and 75.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:17:03,544 INFO L158 Benchmark]: RCFGBuilder took 826.44ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 75.3MB in the beginning and 128.9MB in the end (delta: -53.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-11-19 05:17:03,545 INFO L158 Benchmark]: TraceAbstraction took 31697.10ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 830.5MB). Free memory was 128.9MB in the beginning and 414.8MB in the end (delta: -285.9MB). Peak memory consumption was 544.2MB. Max. memory is 16.1GB. [2023-11-19 05:17:03,545 INFO L158 Benchmark]: Witness Printer took 129.69ms. Allocated memory is still 1.0GB. Free memory was 414.8MB in the beginning and 400.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 05:17:03,547 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.31ms. Allocated memory is still 132.1MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.33ms. Allocated memory is still 132.1MB. Free memory was 92.4MB in the beginning and 79.1MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.28ms. Allocated memory is still 132.1MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.32ms. Allocated memory is still 132.1MB. Free memory was 77.0MB in the beginning and 75.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 826.44ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 75.3MB in the beginning and 128.9MB in the end (delta: -53.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31697.10ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 830.5MB). Free memory was 128.9MB in the beginning and 414.8MB in the end (delta: -285.9MB). Peak memory consumption was 544.2MB. Max. memory is 16.1GB. * Witness Printer took 129.69ms. Allocated memory is still 1.0GB. Free memory was 414.8MB in the beginning and 400.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(c)=65, \old(i___0)=0, c=65, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=2, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=2, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3090 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3078 mSDsluCounter, 5018 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2746 mSDsCounter, 600 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2635 IncrementalHoareTripleChecker+Invalid, 3235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 600 mSolverCounterUnsat, 2272 mSDtfsCounter, 2635 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1790 GetRequests, 1544 SyntacticMatches, 10 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8052 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3663occurred in iteration=14, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 3847 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2917 NumberOfCodeBlocks, 2917 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3207 ConstructedInterpolants, 0 QuantifiedInterpolants, 5980 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2981 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 34 InterpolantComputations, 20 PerfectInterpolantSequences, 2647/2882 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! [2023-11-19 05:17:03,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72f33b37-77e8-415e-9df1-0ae657e26cd4/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE