./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack_longer-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:31:31,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:31:31,448 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-06 20:31:31,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:31:31,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:31:31,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:31:31,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:31:31,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:31:31,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:31:31,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:31:31,523 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:31:31,524 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:31:31,525 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:31:31,527 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:31:31,527 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:31:31,528 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:31:31,528 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:31:31,528 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:31:31,529 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:31:31,529 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:31:31,530 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:31:31,530 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:31:31,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:31:31,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 20:31:31,534 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:31:31,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:31:31,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:31:31,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:31:31,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 20:31:31,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:31:31,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 20:31:31,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:31:31,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 20:31:31,538 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:31:31,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:31:31,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:31:31,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:31:31,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:31:31,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:31:31,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 20:31:31,540 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:31:31,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:31:31,541 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 20:31:31,541 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:31:31,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:31:31,542 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_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/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_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2023-11-06 20:31:31,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:31:31,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:31:31,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:31:31,895 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:31:31,896 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:31:31,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/pthread/stack_longer-1.i [2023-11-06 20:31:35,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:31:35,737 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:31:35,743 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/sv-benchmarks/c/pthread/stack_longer-1.i [2023-11-06 20:31:35,768 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/data/460c5d4d2/54deb63b19d34109988f4461774d27d3/FLAGc757ae3b7 [2023-11-06 20:31:35,786 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/data/460c5d4d2/54deb63b19d34109988f4461774d27d3 [2023-11-06 20:31:35,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:31:35,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:31:35,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:31:35,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:31:35,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:31:35,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:31:35" (1/1) ... [2023-11-06 20:31:35,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628eaacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:35, skipping insertion in model container [2023-11-06 20:31:35,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:31:35" (1/1) ... [2023-11-06 20:31:35,897 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:31:36,499 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_7343e1e3-d114-408c-bd24-2f785de9e652/sv-benchmarks/c/pthread/stack_longer-1.i[41527,41540] [2023-11-06 20:31:36,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:31:36,549 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:31:36,599 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_7343e1e3-d114-408c-bd24-2f785de9e652/sv-benchmarks/c/pthread/stack_longer-1.i[41527,41540] [2023-11-06 20:31:36,612 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:31:36,738 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:31:36,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36 WrapperNode [2023-11-06 20:31:36,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:31:36,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:31:36,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:31:36,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:31:36,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,844 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2023-11-06 20:31:36,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:31:36,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:31:36,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:31:36,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:31:36,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:31:36,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:31:36,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:31:36,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:31:36,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (1/1) ... [2023-11-06 20:31:36,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:31:36,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:31:36,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:31:36,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:31:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-06 20:31:37,000 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-06 20:31:37,000 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-06 20:31:37,001 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-06 20:31:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:31:37,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:31:37,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:31:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:31:37,003 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 20:31:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:31:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:31:37,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:31:37,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:31:37,006 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 20:31:37,178 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:31:37,180 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:31:37,462 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:31:37,473 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:31:37,473 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 20:31:37,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:37 BoogieIcfgContainer [2023-11-06 20:31:37,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:31:37,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:31:37,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:31:37,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:31:37,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:31:35" (1/3) ... [2023-11-06 20:31:37,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f1f13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:31:37, skipping insertion in model container [2023-11-06 20:31:37,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:36" (2/3) ... [2023-11-06 20:31:37,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f1f13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:31:37, skipping insertion in model container [2023-11-06 20:31:37,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:37" (3/3) ... [2023-11-06 20:31:37,487 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2023-11-06 20:31:37,504 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 20:31:37,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:31:37,524 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 20:31:37,524 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 20:31:37,692 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 20:31:37,735 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-06 20:31:37,751 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 166 transitions, 346 flow [2023-11-06 20:31:37,755 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 166 transitions, 346 flow [2023-11-06 20:31:37,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 166 transitions, 346 flow [2023-11-06 20:31:37,848 INFO L124 PetriNetUnfolderBase]: 10/164 cut-off events. [2023-11-06 20:31:37,848 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 20:31:37,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 164 events. 10/164 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 423 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2023-11-06 20:31:37,864 INFO L119 LiptonReduction]: Number of co-enabled transitions 8340 [2023-11-06 20:31:43,897 INFO L134 LiptonReduction]: Checked pairs total: 10878 [2023-11-06 20:31:43,897 INFO L136 LiptonReduction]: Total number of compositions: 155 [2023-11-06 20:31:43,906 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 36 transitions, 86 flow [2023-11-06 20:31:43,946 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 284 states, 281 states have (on average 2.697508896797153) internal successors, (758), 283 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:43,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:31:43,972 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ded96c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:31:43,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 20:31:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 281 states have (on average 2.697508896797153) internal successors, (758), 283 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:31:43,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:43,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:31:43,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:43,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1327010177, now seen corresponding path program 1 times [2023-11-06 20:31:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:44,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829570434] [2023-11-06 20:31:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:44,377 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-06 20:31:44,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829570434] [2023-11-06 20:31:44,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829570434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:44,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:44,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:31:44,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216696627] [2023-11-06 20:31:44,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:44,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:31:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:44,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:31:44,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:44,420 INFO L87 Difference]: Start difference. First operand has 284 states, 281 states have (on average 2.697508896797153) internal successors, (758), 283 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:44,568 INFO L93 Difference]: Finished difference Result 502 states and 1336 transitions. [2023-11-06 20:31:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:31:44,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:31:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:44,589 INFO L225 Difference]: With dead ends: 502 [2023-11-06 20:31:44,589 INFO L226 Difference]: Without dead ends: 502 [2023-11-06 20:31:44,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:31:44,594 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:44,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-11-06 20:31:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 372. [2023-11-06 20:31:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 369 states have (on average 2.7913279132791327) internal successors, (1030), 371 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1030 transitions. [2023-11-06 20:31:44,670 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 1030 transitions. Word has length 6 [2023-11-06 20:31:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:44,670 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 1030 transitions. [2023-11-06 20:31:44,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 1030 transitions. [2023-11-06 20:31:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 20:31:44,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:44,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:44,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:31:44,673 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:44,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 860041069, now seen corresponding path program 1 times [2023-11-06 20:31:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:44,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074623863] [2023-11-06 20:31:44,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:44,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:44,861 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-06 20:31:44,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074623863] [2023-11-06 20:31:44,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074623863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:44,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:31:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322434205] [2023-11-06 20:31:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:44,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:31:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:44,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:31:44,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:44,867 INFO L87 Difference]: Start difference. First operand 372 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:44,963 INFO L93 Difference]: Finished difference Result 450 states and 1202 transitions. [2023-11-06 20:31:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:31:44,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 20:31:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:44,979 INFO L225 Difference]: With dead ends: 450 [2023-11-06 20:31:44,980 INFO L226 Difference]: Without dead ends: 432 [2023-11-06 20:31:44,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:31:44,982 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:44,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-11-06 20:31:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 416. [2023-11-06 20:31:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 412 states have (on average 2.762135922330097) internal successors, (1138), 415 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1138 transitions. [2023-11-06 20:31:45,010 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1138 transitions. Word has length 8 [2023-11-06 20:31:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:45,011 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1138 transitions. [2023-11-06 20:31:45,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:45,012 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1138 transitions. [2023-11-06 20:31:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:31:45,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:45,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:45,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:31:45,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:45,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1410455184, now seen corresponding path program 1 times [2023-11-06 20:31:45,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:45,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807415265] [2023-11-06 20:31:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:45,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:45,085 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-06 20:31:45,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807415265] [2023-11-06 20:31:45,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807415265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:45,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:45,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:31:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839845111] [2023-11-06 20:31:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:45,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:31:45,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:45,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:31:45,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:45,088 INFO L87 Difference]: Start difference. First operand 416 states and 1138 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:45,173 INFO L93 Difference]: Finished difference Result 446 states and 1219 transitions. [2023-11-06 20:31:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:31:45,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 20:31:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:45,179 INFO L225 Difference]: With dead ends: 446 [2023-11-06 20:31:45,179 INFO L226 Difference]: Without dead ends: 446 [2023-11-06 20:31:45,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:31:45,184 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:45,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-11-06 20:31:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2023-11-06 20:31:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 443 states have (on average 2.7516930022573365) internal successors, (1219), 445 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1219 transitions. [2023-11-06 20:31:45,210 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1219 transitions. Word has length 10 [2023-11-06 20:31:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:45,211 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 1219 transitions. [2023-11-06 20:31:45,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1219 transitions. [2023-11-06 20:31:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 20:31:45,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:45,222 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:45,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:31:45,223 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:45,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1341789861, now seen corresponding path program 1 times [2023-11-06 20:31:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397558586] [2023-11-06 20:31:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:31:45,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397558586] [2023-11-06 20:31:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397558586] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:31:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657985576] [2023-11-06 20:31:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:45,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:31:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:31:45,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:31:45,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:31:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:45,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 20:31:45,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:31:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:31:45,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:31:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:31:45,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657985576] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:31:45,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1357109552] [2023-11-06 20:31:45,635 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 20:31:45,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:31:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-11-06 20:31:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690654951] [2023-11-06 20:31:45,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:31:45,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 20:31:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:45,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 20:31:45,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 20:31:45,639 INFO L87 Difference]: Start difference. First operand 446 states and 1219 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:46,063 INFO L93 Difference]: Finished difference Result 1090 states and 2879 transitions. [2023-11-06 20:31:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 20:31:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-06 20:31:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:46,073 INFO L225 Difference]: With dead ends: 1090 [2023-11-06 20:31:46,073 INFO L226 Difference]: Without dead ends: 1090 [2023-11-06 20:31:46,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-11-06 20:31:46,075 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:46,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 20:31:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2023-11-06 20:31:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 798. [2023-11-06 20:31:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 795 states have (on average 2.762264150943396) internal successors, (2196), 797 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2196 transitions. [2023-11-06 20:31:46,111 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2196 transitions. Word has length 14 [2023-11-06 20:31:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:46,112 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 2196 transitions. [2023-11-06 20:31:46,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2196 transitions. [2023-11-06 20:31:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 20:31:46,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:46,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:46,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:31:46,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:31:46,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:46,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1028465190, now seen corresponding path program 1 times [2023-11-06 20:31:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217209614] [2023-11-06 20:31:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:46,460 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-06 20:31:46,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217209614] [2023-11-06 20:31:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217209614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:46,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:31:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982111648] [2023-11-06 20:31:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:46,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:31:46,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:31:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:46,465 INFO L87 Difference]: Start difference. First operand 798 states and 2196 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:46,534 INFO L93 Difference]: Finished difference Result 342 states and 792 transitions. [2023-11-06 20:31:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:31:46,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 20:31:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:46,538 INFO L225 Difference]: With dead ends: 342 [2023-11-06 20:31:46,539 INFO L226 Difference]: Without dead ends: 338 [2023-11-06 20:31:46,539 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-06 20:31:46,542 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:46,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-06 20:31:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 306. [2023-11-06 20:31:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 304 states have (on average 2.3026315789473686) internal successors, (700), 305 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 700 transitions. [2023-11-06 20:31:46,557 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 700 transitions. Word has length 16 [2023-11-06 20:31:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:46,557 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 700 transitions. [2023-11-06 20:31:46,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 700 transitions. [2023-11-06 20:31:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 20:31:46,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:46,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:46,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:31:46,559 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:46,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1305019947, now seen corresponding path program 1 times [2023-11-06 20:31:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:46,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065894721] [2023-11-06 20:31:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:46,720 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-06 20:31:46,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065894721] [2023-11-06 20:31:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065894721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:46,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:46,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:31:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898983807] [2023-11-06 20:31:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:46,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:31:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:46,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:31:46,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:31:46,722 INFO L87 Difference]: Start difference. First operand 306 states and 700 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:46,885 INFO L93 Difference]: Finished difference Result 432 states and 982 transitions. [2023-11-06 20:31:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:31:46,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-06 20:31:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:46,890 INFO L225 Difference]: With dead ends: 432 [2023-11-06 20:31:46,890 INFO L226 Difference]: Without dead ends: 432 [2023-11-06 20:31:46,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:31:46,891 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:46,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:46,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-11-06 20:31:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 340. [2023-11-06 20:31:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 338 states have (on average 2.3136094674556213) internal successors, (782), 339 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 782 transitions. [2023-11-06 20:31:46,907 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 782 transitions. Word has length 17 [2023-11-06 20:31:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:46,908 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 782 transitions. [2023-11-06 20:31:46,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 782 transitions. [2023-11-06 20:31:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 20:31:46,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:46,910 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] [2023-11-06 20:31:46,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 20:31:46,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:46,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2140318582, now seen corresponding path program 1 times [2023-11-06 20:31:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679859525] [2023-11-06 20:31:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:47,847 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-06 20:31:47,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679859525] [2023-11-06 20:31:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679859525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 20:31:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019127366] [2023-11-06 20:31:47,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:47,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 20:31:47,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:47,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 20:31:47,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 20:31:47,854 INFO L87 Difference]: Start difference. First operand 340 states and 782 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:48,449 INFO L93 Difference]: Finished difference Result 540 states and 1232 transitions. [2023-11-06 20:31:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:31:48,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-06 20:31:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:48,454 INFO L225 Difference]: With dead ends: 540 [2023-11-06 20:31:48,454 INFO L226 Difference]: Without dead ends: 540 [2023-11-06 20:31:48,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-06 20:31:48,455 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:48,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 20:31:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2023-11-06 20:31:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 460. [2023-11-06 20:31:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 458 states have (on average 2.3799126637554586) internal successors, (1090), 459 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1090 transitions. [2023-11-06 20:31:48,475 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1090 transitions. Word has length 21 [2023-11-06 20:31:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:48,476 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 1090 transitions. [2023-11-06 20:31:48,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1090 transitions. [2023-11-06 20:31:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 20:31:48,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:48,478 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] [2023-11-06 20:31:48,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 20:31:48,478 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:48,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -172770520, now seen corresponding path program 2 times [2023-11-06 20:31:48,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:48,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509991512] [2023-11-06 20:31:48,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:49,429 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-06 20:31:49,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:49,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509991512] [2023-11-06 20:31:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509991512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:49,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 20:31:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754766813] [2023-11-06 20:31:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:49,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 20:31:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:49,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 20:31:49,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 20:31:49,432 INFO L87 Difference]: Start difference. First operand 460 states and 1090 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:50,096 INFO L93 Difference]: Finished difference Result 630 states and 1466 transitions. [2023-11-06 20:31:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:31:50,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-06 20:31:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:50,103 INFO L225 Difference]: With dead ends: 630 [2023-11-06 20:31:50,103 INFO L226 Difference]: Without dead ends: 630 [2023-11-06 20:31:50,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-06 20:31:50,104 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:50,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 20:31:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2023-11-06 20:31:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 446. [2023-11-06 20:31:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 444 states have (on average 2.3716216216216215) internal successors, (1053), 445 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1053 transitions. [2023-11-06 20:31:50,126 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1053 transitions. Word has length 21 [2023-11-06 20:31:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:50,126 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 1053 transitions. [2023-11-06 20:31:50,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1053 transitions. [2023-11-06 20:31:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 20:31:50,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:50,128 INFO L195 NwaCegarLoop]: trace histogram [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-06 20:31:50,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 20:31:50,128 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 20:31:50,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 855968639, now seen corresponding path program 1 times [2023-11-06 20:31:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:50,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263850734] [2023-11-06 20:31:50,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:31:50,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 20:31:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:31:50,237 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-06 20:31:50,237 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 20:31:50,238 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 20:31:50,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-11-06 20:31:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 20:31:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-06 20:31:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-06 20:31:50,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 20:31:50,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 20:31:50,244 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:50,251 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 20:31:50,251 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 20:31:50,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:31:50 BasicIcfg [2023-11-06 20:31:50,340 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 20:31:50,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 20:31:50,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 20:31:50,341 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 20:31:50,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:37" (3/4) ... [2023-11-06 20:31:50,343 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 20:31:50,420 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/witness.graphml.graphml [2023-11-06 20:31:50,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 20:31:50,421 INFO L158 Benchmark]: Toolchain (without parser) took 14625.37ms. Allocated memory was 130.0MB in the beginning and 262.1MB in the end (delta: 132.1MB). Free memory was 82.2MB in the beginning and 212.7MB in the end (delta: -130.5MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2023-11-06 20:31:50,421 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:31:50,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 938.97ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 81.9MB in the beginning and 140.9MB in the end (delta: -59.0MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2023-11-06 20:31:50,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.72ms. Allocated memory is still 180.4MB. Free memory was 140.9MB in the beginning and 138.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:31:50,423 INFO L158 Benchmark]: Boogie Preprocessor took 68.11ms. Allocated memory is still 180.4MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:31:50,423 INFO L158 Benchmark]: RCFGBuilder took 562.20ms. Allocated memory is still 180.4MB. Free memory was 136.1MB in the beginning and 118.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 20:31:50,424 INFO L158 Benchmark]: TraceAbstraction took 12860.68ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 118.0MB in the beginning and 221.1MB in the end (delta: -103.1MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2023-11-06 20:31:50,424 INFO L158 Benchmark]: Witness Printer took 79.87ms. Allocated memory is still 262.1MB. Free memory was 221.1MB in the beginning and 212.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 20:31:50,426 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 938.97ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 81.9MB in the beginning and 140.9MB in the end (delta: -59.0MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.72ms. Allocated memory is still 180.4MB. Free memory was 140.9MB in the beginning and 138.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.11ms. Allocated memory is still 180.4MB. Free memory was 138.2MB in the beginning and 136.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.20ms. Allocated memory is still 180.4MB. Free memory was 136.1MB in the beginning and 118.7MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12860.68ms. Allocated memory was 180.4MB in the beginning and 262.1MB in the end (delta: 81.8MB). Free memory was 118.0MB in the beginning and 221.1MB in the end (delta: -103.1MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. * Witness Printer took 79.87ms. Allocated memory is still 262.1MB. Free memory was 221.1MB in the beginning and 212.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 163 PlacesBefore, 38 PlacesAfterwards, 166 TransitionsBefore, 36 TransitionsAfterwards, 8340 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 97 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 5 ChoiceCompositions, 155 TotalNumberOfCompositions, 10878 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8381, independent: 8210, independent conditional: 0, independent unconditional: 8210, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6094, independent: 6022, independent conditional: 0, independent unconditional: 6022, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6094, independent: 5995, independent conditional: 0, independent unconditional: 5995, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 318, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 262, dependent conditional: 0, dependent unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8381, independent: 2188, independent conditional: 0, independent unconditional: 2188, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 6094, unknown conditional: 0, unknown unconditional: 6094] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 940]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(400)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=398, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=399, top=0] [L1004] 2 int i; [L1005] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=399, top=1] [L990] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=399, top=1] [L1005] COND TRUE 2 i<(400) [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1021]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 940]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 266 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 404 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 0 mSDtfsCounter, 1528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=798occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 826 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1319 SizeOfPredicates, 1 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/9 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-06 20:31:50,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7343e1e3-d114-408c-bd24-2f785de9e652/bin/utaipan-verify-FOvIYxoinp/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